20200815, 07:47  #1 
Aug 2020
1100_{2} Posts 
Formula for prime numbers of the form (m)*(n)+1
Proof of the Twin primes Conjecture and Goldbach's conjecture We can find infinite prime numbers with the separation we want and we can express every even number as the sum of two prime numbers. http://www.academia.edu/43581083/Pro...chs_conjecture

20200815, 20:17  #2 
Aug 2006
3×1,987 Posts 
The crux of the proof is on p. 3:
I have tried it with high numbers and it seems that there is no problem, which would be to say that there are infinite prime numbers separated the quantity that we want.I'll note that the method requires taking large symbolic derivatives and then factoring integers far larger than the twin primes generated, so this is not an algorithmic improvement. 
20200816, 13:35  #3  
Feb 2012
Prague, Czech Republ
13^{2} Posts 
Quote:
It's fine if you prefer to sell it for money. It's bad to "publish" it for free  but at a site that requires registration and or login. Some, if not most people, may chose to simply go away. 

20200817, 00:36  #4  
Nov 2016
5314_{8} Posts 
Quote:
Also, there is no infinite (at most one pair) prime numbers with separation n when n is odd!!! Last fiddled with by sweety439 on 20200817 at 00:37 

20200817, 13:18  #5  
Feb 2017
Nowhere
3×7×199 Posts 
This magnum opus does not begin well.
Quote:
It continues into the demonstrably false: Quote:
The zeros of y^2  3*y + 1 are so, taking x = y^(p/2), we have 

20201014, 23:52  #6 
Aug 2020
2^{2}·3 Posts 
Update of the Formula for prime numbers of the form (m)*(n)+1

20201016, 08:47  #7 
Aug 2020
14_{8} Posts 
Formulas for Prime Numbers
Last fiddled with by Dr Sardonicus on 20201016 at 12:03 
20201016, 22:51  #8 
Aug 2020
12_{10} Posts 
Formula for prime numbers of the form (m)*(n)+1
Formula that returns prime numbers of the form (m)*(n)+1 how many prime numbers between 1 and 1000000 I used a polynomyal that it´s roots are the golden ratio squared and the golden ratio conjugate. When I aply fractional exponents to the x the polinomyal it´s roots returns lucas and fibonacci numbers exactly. And when I derivate this function I obtain prime numbers included in one number of the structure of the derivative, but there are more that prime numbers come in relation with the order of the derivative multiplied for the fractional exponent. Is like there a relation between fibonacci and lucas numbers and prime number where the original polynomial derivated adapted his form to returns special prime numbers.
https://www.researchgate.net/publica...f_the_form_mn1 
20201016, 23:09  #9 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
59·157 Posts 
Mod warning:
Stop spamposting. Next duplicate posts (and crossposts) will be deleted altogether, 
20201017, 04:43  #10 
Aug 2006
3·1,987 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Formula for prime numbers of the form (m)*(n)+1  Hugo1177  Miscellaneous Math  1  20200823 17:52 
Is this (prime numbers) formula known ?  Godzilla  Miscellaneous Math  10  20180927 02:23 
Most Abundant form of Prime Numbers  a1call  Information & Answers  17  20170226 22:01 
"prime numbers formula" crankery  MiniGeek  Miscellaneous Math  12  20090304 16:51 