Skip to main content
MathOverflow
Đào Thanh Oai's user avatar
Đào Thanh Oai's user avatar
Đào Thanh Oai's user avatar
Đào Thanh Oai
  • Member for 6 years, 8 months
  • Last seen this week
Profile Activity

869 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
asked
Is $P_{2n} \ge 2P_n$ and $\pi(2x) \le 2\pi(x)$ inconsistent to the Prime k-tuple conjecture?
comment
Advanced view of the napkin ring problem?
@MichaelHardy Dear Sir, I know You four year ago on wiki, now this theorem have 9 cite publish in 5 Journals. Can You convert to en.wiki See also: mathoverflow.net/questions/234053/…
comment
Advanced view of the napkin ring problem?
@MichaelHardy Dear Sir, I know You four year ago on wiki, now this theorem have 9 cite publish in 5 Journals. Can You convert to en.wiki See also: mathoverflow.net/questions/234053/…
comment
Is every odd positive integer of the form $P_{n+m}-P_n-P_m$?
@GerhardPaseman When You ask, it is 1 AM in my country, I was going to sleep. So now the answer. Click link as follows to view. In the file, I define that. $Amn=P_{m+n}, Am=P_{m}, An=P_n, C=P_{m+n}-P_m-P_n$ the answer in this text file
comment
Is every odd positive integer of the form $P_{n+m}-P_n-P_m$?
I am sorry, I didn't print $m, n$ so please waiting me. @GerhardPaseman
comment
Is every odd positive integer of the form $P_{n+m}-P_n-P_m$?
I’m sorry, I think the result can checked by Computer
revised
Is every odd positive integer of the form $P_{n+m}-P_n-P_m$?
deleted 6 characters in body
asked
Is every odd positive integer of the form $P_{n+m}-P_n-P_m$?
revised
Strengthened version of Isoperimetric inequality with n-polygon
edited tags
awarded
 Promoter
accepted
Prove: If $P_n$ is $n$-$th$ prime number then $P_{n+m} \ge P_n+P_m$
accepted
$\sum_{k=1}^n\frac{\sin kx}{k^\alpha} >0\quad\text{for all}\ n=1,2,3,\ldots\ \text{and}\ 0<x<\pi, \text{and}\ \alpha \ge 1$
comment
Prove: If $P_n$ is $n$-$th$ prime number then $P_{n+m} \ge P_n+P_m$
My conjecture equivalent to $\pi(x+y) \le \pi(x)+\pi(y)+1$
comment
Prove: If $P_n$ is $n$-$th$ prime number then $P_{n+m} \ge P_n+P_m$
I am sorry. I think your proof maybe false at (2)==> (1). I think (2) ==> $\pi(x+y) \le \pi(x)+\pi(y)+1$ ?
comment
Prove: If $P_n$ is $n$-$th$ prime number then $P_{n+m} \ge P_n+P_m$
There is a good answer, if we can convert my conjecture with form $\pi(x+y) \le \pi(a)+\pi(b)$ where $a, b=f(x,y)$ after that we can compare with k-tuplet conjecture.
comment
What is the limit of gcd(1! + 2! + ... + (n-1)! , n!) ?
Dear Sir @Tao can you see mathoverflow.net/questions/303141/on-the-ab-c-conjecture
comment
The resultant and the ideal generated by two polynomials in $\mathbb{Z}[x]$
Dear Sir @FelipeVoloch Could You see? mathoverflow.net/questions/303141/on-the-ab-c-conjecture
asked
$\sum_{k=1}^n\frac{\sin kx}{k^\alpha} >0\quad\text{for all}\ n=1,2,3,\ldots\ \text{and}\ 0<x<\pi, \text{and}\ \alpha \ge 1$
awarded
 Critic
comment
Prove: If $P_n$ is $n$-$th$ prime number then $P_{n+m} \ge P_n+P_m$
@GregMartin I am sorry, May You see answer below and my comment below?
1
…
38 39
40
41 42
…
44