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 |
On the blending of real/complex analysis with number theory. The study involves distribution of prime numbers and other problems and helps giving asymptotic estimates to these.
1
vote
0
answers
736
views
Can the prime gap record of Liu be improved further?
Let $d$ be the least positive integer such that there are infinitely many distinct prime pairs $\{p,q\}$ with $|q-p|\le d$. The twin prime conjecture is equivalent to $d=2$. In 2013 Yitang Zhang prove …
4
votes
1
answer
301
views
Waring's problem over $\mathbb Q_{\ge0}$
Let $k$ be a positive integer. Note that $a/b=ab^{k-1}/b^k$ for any integers $a$ and $b>0$.
If every $n\in\mathbb N=\{0,1,2,\ldots\}$ can be written as $x_1^k+\cdots+x_{s}^k$ with $x_1,\ldots,x_s\in\m …
3
votes
1
answer
297
views
Write $2n+1=p+q$ with $p$ prime and $q$ practical
Recall that a positive integer $n$ is callled practical if every $m=1,\ldots,n$ can be written as the sum of some distinct divisors of $n$. The only odd practical number is $1$.
In 1996 G. Melfi [J. …
3
votes
0
answers
125
views
On the set $\{n>0:\ n\ \text{is a quadratic nonresidue modulo the}\ n\text{th prime}\}$
Let $S$ denote the set of positive integers $n$ with $n$ a quadratic nonresidue modulo the $n$th prime $p_n$. The first 20 elements of $S$ are
$$2,\, 3,\, 6,\, 7,\, 8,\, 10,\, 11,\, 13,\, 15,\, 18,\, …
4
votes
0
answers
140
views
Is it true that $|\{k^{k+1}+(k+1)^k\pmod p:\ k=0,\ldots,p-1\}|=(1-e^{-1})p+O(\sqrt{p})\ ?$
For each prime $p$, let us define
$$w_p:=|\{k^{k+1}+(k+1)^k\pmod p:\ k=0,\ldots,p-1\}|,$$
where $a\pmod p$ denotes the residue class $a+p\mathbb Z$.
Based on my computation, I conjecture that
$$w_p …
3
votes
1
answer
334
views
A conjecture for primes $p\equiv\pm1\pmod5$
For any prime $p\equiv\pm1\pmod5$, we can write $p$ uniquely in the form $x_p^2+3x_py_p+y_p^2$ with $x_p,y_p\in\mathbb Z$ and $x_p>y_p>0$.
I have the following conjecture.
Conjecture. We have
$$\li …
3
votes
0
answers
192
views
Conjectures for primes $p\equiv1\pmod3$
Let $p$ be a prime with $p\equiv1\pmod3$. It is well known that we can write $p$ uniquely as $a_p^2+a_pb_p+b_p^2$ with $a_p,b_p\in\mathbb Z$ and $a_p>b_p>0$.
Note that $a_b\not \equiv b_p\pmod3$. Thus …
56
votes
1
answer
4k
views
A mysterious connection between primes and $\pi$
The Prime Number Theorem relates primes to the important constant $e$.
Here I report my following surprising discovery which relates primes to $\pi$.
Conjecture (December 15, 2019). Let $s(n)$ be th …
6
votes
0
answers
203
views
Primes $p\in(n,2n)$ with $(\frac{-n}p)=-1$
Bertrand's postulate proved by Chebyshev states that for any $x>1$ there is a prime $p$ in the interval $(x,2x)$. In 2012 I considered some refinements of this by imposing additional requirement invol …
1
vote
0
answers
156
views
On segments of the series $\sum_p\frac1{p-1}$
Here I ask a question concerning segments of the divergent series
$$\sum_p\frac1{p-1}=\sum_{k=1}^\infty\frac1{p_k-1},\tag{$*$}$$
where $p$ runs over all the primes, and $p_k$ denotes the $k$-th prime. …
3
votes
0
answers
131
views
Chen primes and permutations
In 1973 the Chinese mathematician J.-R. Chen proved that there are infinitely many primes $p$ such that $p+2$ is a product of at most two primes. Nowadays such primes $p$ are called Chen primes.
For …
37
votes
3
answers
2k
views
How to prove the identity $L(2,(\frac{\cdot}3))=\frac2{15}\sum\limits_{k=1}^\infty\frac{48^k...
For the Dirichlet character $\chi(a)=(\frac a3)$ (which is the Legendre symbol), we have
$$L(2,\chi)=\sum_{n=1}^\infty\frac{(\frac n3)}{n^2}=0.781302412896486296867187429624\ldots.$$
Note that this se …
5
votes
1
answer
940
views
Are all the numbers $\pi(n^2)/n^2\ (n=1,2,3,\ldots)$ pairwise distinct?
For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. A well-known conjecture of Legendre states that $\pi(n^2)<\pi((n+1)^2)$ for any positive integer $n$. Here I ask the following nat …