| Psychology and Mental Health Forum | |
https://www.psychforums.com/blog/index/index_b-8235.html |
|
| Author: | highdimensionman [ Sat Apr 04, 2015 9:42 am ] |
| Blog Subject: | An easyish way to tell if a big number is a prime. |
So for your number n you have a list of n-1 1's and a zero. Convert this list with base 2 and base 5 conversion and mod by n. if the number is 2 it's prime also if both of your modulations are 0 it's very probably if not certianly a prime. Using the optimisation techniques in base coversion already known it should be reatively easy to get the modulation results without having to convert most of the digits. This means if always true then this is fastest primality test on earth. |
|
| All times are UTC | |
Powered by phpBB © 2002, 2006 phpBB Group www.phpbb.com |
|