![]() |
![]() |
#12 | |
Romulan Interpreter
"name field"
Jun 2011
Thailand
9,973 Posts |
![]() Quote:
You want to do that by trial division? With a computer sieving a million billions trillions quadrillions primes per pico-second (to be clear, that is a computer larger than the size of the earth, and probably done by quantum technology, filtering 1000000000000000000000000000000000000000000000000000000 primes every second (that is a 1 followed by 6+9+12+15+12 zeroes) you still need about 10^12300000 years to finish it... (that is a 1 followed by about 12 million zeros, in base ten). People dont really realize how large these numbers are. Last fiddled with by LaurV on 2022-01-30 at 06:47 Reason: s/quatralions/quadrillions/ |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Congruent prime numbers that preserves the modulo as the largest prime factor of the sum | Hugo1177 | Miscellaneous Math | 5 | 2021-02-11 07:40 |
What can you do with 2 prime numbers? | VicDiesel | Programming | 12 | 2017-04-20 21:16 |
Prime Numbers Or Not | Arxenar | Miscellaneous Math | 38 | 2013-06-28 23:26 |
All odd numbers are prime | Citrix | Lounge | 5 | 2010-04-05 21:34 |
Prime numbers | Unregistered | Miscellaneous Math | 8 | 2008-11-09 07:45 |