comment
Generalization of some plane geometry theorems
I am sorry! $n+1 \equiv 1 $ mean: Taking subscripts modul $n$, $\ell$ is real number. I corrected.
revised
Generalization of some plane geometry theorems
edited title
Loading…
revised
Generalization of some plane geometry theorems
deleted 4 characters in body; edited title
Loading…
revised
Generalization of some plane geometry theorems
added 77 characters in body
Loading…
revised
Generalization of some plane geometry theorems
deleted 890 characters in body
Loading…
revised
Rearrangement inequality for sum
edited tags
Loading…
Loading…
comment
The number of continuously increasing primes gaps in the interval $[2,n]$ is less than $\log n$
@GerryMyerson Thank you, I have just hecked and updated
revised
The number of continuously increasing primes gaps in the interval $[2,n]$ is less than $\log n$
deleted 16 characters in body
Loading…
comment
Let $X$ be a positive integer. Then $\pi{(X+\ln^2{X})}-\pi{(X-\ln^2{X})}>\ln{X}$?
I thinks this conjecture is stronger than some old conjecture. Because $\ln x > 1, 2, 3, 4,.....$ when $x> e^{1}, e^{2}, e^{3}, e^{4}.....$ and with any positive interger $n$ then exist $x$ such that $(x-ln^2{x}, x+ln^2{x}) \subset (n^2, (n+1)^2)$
awarded
revised
The number of continuously increasing primes gaps in the interval $[2,n]$ is less than $\log n$
added 135 characters in body
Loading…
comment
Is every odd positive integer of the form $P_{n+m}-P_n-P_m$?
Yes, you are right. I don't know what Conjecture 1 has to do with Goldbach's conjecture, may you help me? @GerryMyerson
comment
Is every odd positive integer of the form $P_{n+m}-P_n-P_m$?
@GerryMyerson Today, I see that maybe conjecture 1 equivalent to Goldbach's conjecture en.wikipedia.org/wiki/Goldbach%27s_conjecture or Corollary of the Goldbach's conjecture, because $P_n+P_m=P_{n+m}-x=y$. Where $x$ is an odd positive integer less than $P_{n+m}$ then $y$ is an odd positive integer less $P_{n+m}$. But maybe we must prove that $P_n+P_m \le P_{m+n}$. Is my remark right?
comment
The number of continuously increasing primes gaps in the interval $[2,n]$ is less than $\log n$
@GerryMyerson I have just checked it true upto $9.7*10^8$, Thanks you very much