20220213, 14:49  #1 
"Claudio"
Feb 2022
Europa, Portogallo
2^{3} Posts 
Search prime numbers by dimension
Good morning
My name is Claudio Govi โโand I am an Italian who lives in Portugal. I joined this forum to publish a new method of research on prime numbers. The method I would like to publish differs from the other methods because it looks for prime numbers in a dimension and no longer as a single number. This method will give me two advantages. The first is that the numbers found will all be 100% prime . The second advantage is that I can do without probabilistic or primality tests. Before publishing it, however, I ask the courtesy to confirm the following ... When I search for a very large prime number, the first thing I do is to try, through probabilistic tests, to identify a prime candidate that gives me a high probability of being prime. Then I run the test with a sieve and confirm or deny that the number is prime or not. Right? In the search by dimension this does not happen. In this search, all the prime numbers within it are securely identified. My computer is a small computer with very limited computing power. It takes almost an hour and a half to prove that a number of only 23 digits is a safe prime. In the search by dimension, however, this happens ... N = 23digit number (10100010001000100001089) X = 100,000 (dimension) Total calculation hours 5:30. Safe primes found 2026 Calculation hours for each prime number found 0: 0: 10 Thanks for your attention 
20220213, 15:42  #2  
Sep 2002
Database er0rr
4252_{10} Posts 
Quote:
Quote:
Quote:
Quote:
Quote:
Quote:


20220213, 16:23  #3  
Feb 2017
Nowhere
1011100001001_{2} Posts 
Quote:
Code:
? n=10100010001000100001089;c=1;forstep(i=2,100000,[6,4,2,4,2,4,6,2],m=n+i;if(ispseudoprime(m),c++));print(c) 2026 ? n=10100010001000100001089;c=1;forstep(i=2,100000,[6,4,2,4,2,4,6,2],m=n+i;if(isprime(m),c++));print(c) 2026 

20220213, 16:55  #4 
"Claudio"
Feb 2022
Europa, Portogallo
8_{16} Posts 
First of all thanks for your answer. I apologize for my English because I use a translator.
By safe prime I mean this 10100010001000100120893 which is a prime number. As for the mathematical language there is not much to say. The algorithm creates a map of all prime numbers in a dimension called X. My example on a 23digit number is just a way to highlight that with a little more time than looking for a prime number, the algorithm finds hundreds and thousands of prime numbers. "Pari/GP can prove such small primes in less than a millisecond even on slow hardware." I know that 23 digits is not a big number and that it is found in less than a thousand seconds but what if I told you that you could find thousands of prime numbers in less than a thousand seconds? Given a number N of any size and a finite dimension X, the algorithm maps this dimension using only the calculation to define whether N is prime or not. If I want to know with absolute certainty whether a number is prime or not, must I exclude that in all the prime numbers that precede it up to its root there is no divisor that cancels its primality? correct? how this technique is used does not matter except in order to speed up the time taken, but in the end this is the only way to confirm without doubt that the number you are looking for is a prime number Now, I am saying that this algorithm maps all prime numbers into the X dimension and if it takes my computer 1.5 hours to find a prime number and yours takes less than a thousandth of a second, it means that you will take less than a thousandth of a second, or a little more, to find thousands of prime numbers 
20220213, 17:00  #5 
"Claudio"
Feb 2022
Europa, Portogallo
1000_{2} Posts 
How many digits does a complicated prime number have for you?

20220213, 17:22  #6  
"Curtis"
Feb 2005
Riverside, CA
2·2,689 Posts 
Quote:
You keep using the word "dimension", and you keep doing so without telling us what you think it means. Until you do so, we will continue to believe you haven't discovered anything new, and are just making up words to describe something already known. 

20220213, 17:31  #7  
Feb 2017
Nowhere
13411_{8} Posts 
Quote:
And before you post again, please read and study this thread, this thread, this thread, this thread, this thread, this thread, and this thread until you understand them all. Thank you. Last fiddled with by Dr Sardonicus on 20220213 at 17:34 Reason: insert missing word 

20220213, 17:46  #8  
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2C9F_{16} Posts 
Quote:
If it helps you get your message over, please post in either (or both) languages and perhaps we may get a better translation than Google Translate can provide. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
A way to search prime divisors of Mersenne numbers  Jinyuan Wang  Factoring  3  20200127 18:12 
Exponential prime search  Citrix  Prime Sierpinski Project  37  20090817 06:32 
Prime Search on PS3?  Kosmaj  Riesel Prime Search  6  20061121 15:19 
All generalized binary number systems up to dimension 11  jasong  Math  1  20060923 20:20 
Search for Mersenne primes by checking for perfect numbers  dsouza123  Miscellaneous Math  33  20030902 16:18 