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