![]() |
![]() |
#1 |
"Cristian Siroca"
Oct 2022
1 Posts |
![]()
Hello I'm new so I don't know exactly if this is the right section but since have code in the repository I supouse it could be :)
Math is not my best quality but im curious and like to dig things up. I think I found a simple algorithm that just produces prime numbers in order. I tested it and works for the first 10k prime numbers but my PC won't work for heavy stuff of millions of digits so I decided to stop there. Can someone check if it is really legit? https://github.com/CristianS9/prime_number_algorithm |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Formula for prime numbers of the form (m)*(n)+1 | Hugo1177 | Miscellaneous Math | 9 | 2020-10-17 04:43 |
Formula for prime numbers of the form (m)*(n)+1 | Hugo1177 | Miscellaneous Math | 1 | 2020-08-23 17:52 |
Endorsement Prime Numbers finding algorithm | marouane | Computer Science & Computational Number Theory | 18 | 2017-11-06 15:41 |
Most Abundant form of Prime Numbers | a1call | Information & Answers | 17 | 2017-02-26 22:01 |
This simple algorithm incomplete can only calculate prime numbers? | Ale | Miscellaneous Math | 38 | 2015-11-29 23:27 |