how can be proven ? - always there exist prime numbers p_1,p_2,p_3 >= 5 so the form of 6n+/- 1 ,that every prime numbers greater than 19 can be expressed in the form of p_1 +p_2 +p_3
@Hero @Vocaloid
@Shadow @dude pls any idea ? ty so much
https://math.stackexchange.com/questions/671820/proving-an-infinite-number-of-primes-of-the-form-6n1
okay one question what grade is this
\(\color{#0cbb34}{\text{Originally Posted by}}\) @callmeizzy1234 okay one question what grade is this \(\color{#0cbb34}{\text{End of Quote}}\) he's like 34
so adult college
\(\color{#0cbb34}{\text{Originally Posted by}}\) @b3lla2006 \(\color{#0cbb34}{\text{Originally Posted by}}\) @callmeizzy1234 okay one question what grade is this \(\color{#0cbb34}{\text{End of Quote}}\) he's like 34 \(\color{#0cbb34}{\text{End of Quote}}\) no he's not. ._.
yes
This problem is similar to Goldbach's conjecture
I scanned the all the primes in the range [1, 1e6] and they all can be expressed as a sum of p1 + p2 + p3 I used \(\href{https://p.ip.fi/s5dI}{this}\) script to check the above.
@chimichanga
Join our real-time social learning platform and learn together with your friends!