diff options
| author | Alexander Pankoff <ccntrq@screenri.de> | 2020-09-01 14:27:08 +0200 |
|---|---|---|
| committer | Alexander Pankoff <ccntrq@screenri.de> | 2020-09-01 14:49:20 +0200 |
| commit | c647f85b3c2dc323764157ab940faaaad81a32e4 (patch) | |
| tree | 3a2b69eed73a57cc8d5e1d97c9c3b2148bb7c0c5 /challenge-077/ash/cpp/ch-2.cpp | |
| parent | fcd5ca1f59d0df1ebaaa630f2afff9d99a2b40dc (diff) | |
| download | perlweeklychallenge-club-c647f85b3c2dc323764157ab940faaaad81a32e4.tar.gz perlweeklychallenge-club-c647f85b3c2dc323764157ab940faaaad81a32e4.tar.bz2 perlweeklychallenge-club-c647f85b3c2dc323764157ab940faaaad81a32e4.zip | |
rework challenge-076-01 using goldbach's conjecture
looking through the other solutions i found this reference in @andinus
blog article:
https://stackoverflow.com/questions/35755825/find-minimum-prime-numbers-which-sum-to-a-given-value/35756072#35756072
I reworked my brute force solution to make use of the conjecture
assuming it is true for any N that will ever be feed to this programm.
The conjecture has been shown to hold for any $N < 4x10^18 which should
be sufficiently large.
Diffstat (limited to 'challenge-077/ash/cpp/ch-2.cpp')
0 files changed, 0 insertions, 0 deletions