Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
For questions about sequences of integers. References are often made to the online resource oeis.org.
12
votes
What is the asymptotic of the irregular blue curve? Is it $(8x)^{1/2}$ or is it something else?
Let us denote the left hand side of $(1)$ by $\psi(x)$. It is known that $|\psi(x)-x|$ is not bounded by a constant times $x^{1/2}$. In fact Littlewood (1914) proved that
$$\psi(x)-x=\Omega_{\pm}(x^{1 …
11
votes
Accepted
Min problem on integers
Let us denote
$$\sigma_\ell:=\sum_{i=1}^\ell q_i\qquad\text{and}\qquad\tau_\ell:=\sum_{i=\ell+1}^s\frac{1}{q_i}.$$
Then
$$\prod_{\ell=1}^{s-1}\left(\frac{q_\ell}{q_{\ell+1}}\cdot\frac{\sigma_{\ell+1}} …
7
votes
Accepted
Cardinality of $\{ n_i + i^k: i \in \mathbb{N} \} \cap [1,T]$ where $\{n_i \}$ is all natura...
Such a lower bound is not possible, even when $k=1$. Indeed, there exists a sequence $(n_1,n_2,\dotsc)$ containing every natural number such that for infinitely many positive integers $N$ we have $n_i …
4
votes
Accepted
Small solutions of $x^2-a^3 y^2=\pm 1$
It is better to ask one question per post. Here is the answer to Q1.
Assume that $(x,y)$ is a positive integer solution of $(1)$. Then $(x,ay)$ is a solution of $X^2-aY^2=1$. Let us restrict to $a=u^2 …
3
votes
Accepted
The Euler's totient function and the product of distinct primes dividing $n$ versus the Hero...
Your conclusion is valid, and for this we only need to assume that $\varphi(3n)$ is divisible by $3$. Indeed, this weaker condition is equivalent to the existence of a prime divisor $p\mid n$ that is …
1
vote
Accepted
Elementary description to count of perfect squares - I
As hinted in Alex Kruckman's comment, it is easier to work with
$$N'(a) = \left|\{x\in \{1,\dots,a-1\} : \sqrt{x(a-x)}\in \mathbb{Z}\}\right|,$$
which is the same as $N(a)$ up to a factor of $2$.
It i …