HI :)
here is my submission : 22598258
It dosen't use Goldbach's Conjecture .
Do you think this solution is true ? or testcases were weak?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
HI :)
here is my submission : 22598258
It dosen't use Goldbach's Conjecture .
Do you think this solution is true ? or testcases were weak?
| Name |
|---|



Why 200? Why 1900? As long as these numbers are randomly selected your solution is wrong.
I think this solution is wrong too ...
and i use 200 & 1900 to dont get TLE .
but also this one :22599100 (200 and 40000)didn't get TLE too ...
Well, you've answered your own question!
actually i want a testcase that make my solution wrong ...
but i can not find that
You are assumimg that any even number n < 109 can be decomposed as n = p + q with p, q primes and p < 1900. Similar for odd number n = p + q + t with p, q < 200.
I've tried some random n and the maximum minimum p I could get is 1171, for n = 343553258.
acctualy test 65 has n=1847133842 which 1800<p<1900 and that was maximum p among the tests.
Then I guess the two-prime part is correct. OEIS has only 335070838 with p=1427.
So do you have any idea about 3 prime part?