The greatest number theorist in mathematical universe, Leonhard Euler had discovered some formulas and relations in number theory, which were based on practices and were correct to limited extent but still stun the mathematicians. The prime generating equation by Euler is a very specific binomial equation on prime numbers and yields more primes than any other relations out there in number theory. Euler told that the equation $ f(x)=x^2+x+k$ yields many prime numbers with the values of x being input from x=0 to $x=k-2$ ; k being a prime.

Let’s see how many primes we can get by using different values of $k$ and $x$:

Serial NumberValue of k (prime)Value of x (from x=0 to x=k-2)Value of f(x)=(x^2+x)+kNot a Prime?
1202
2303
315
4505
517
6211
7317
8707
919No
10213
11319
12427No
13537
1411011
15113
16217
17323
18431
19541
20653
21767
22883
239101
2413013
25115No
26219
27325No
28433No
29543
30655No
31769No
32885NO
339103
3410123No
3511145No
3617017
37119
38223
39329
40437
41547
42659
43773
44889
459107
4610127
4711149
4812173
4913199
5014227
5115257
5219019
53121
54225No
55331
56439No
57549
58661
59775No
60891No
619109
6210129No
6311151
6412175No
6513201No
6614229
6715259
6816291
6917325No
7023023
71125No
72229
73335No
74443
75553
76665No
77779
78895No
799113
8010.133
8111155No
8212179
8313205No
8414233
8515263
8616295No
8717329
8818365No
8919403
9020443
9121485No

The above table yields many prime numbers, which again can be put at the place of k and so on the table can be progressed.

According to Euler, 41 was the most appropriate value of k yielding more prime numbers than any other k. In the list below, each value of f(x) is a prime for k=41:

k=
41
x=
0
f(x)=
41
143
247
353
461
571
683
797
8113
9131
10151
11173
12197
13223
14251
15281
16313
17347
18383
19421
20461
21503
22547
23593
24641
25691
26743
27797
28853
29911
30971
311033
321097
331163
341231
351301
361373
371447
381523
391601

So, the Euler’s Prime Generating Equation can be written as
$ f(x) = x^2+x+41$ ; where $x$ is an integer ranging from 0 to 39.

What if we increase the value of x beyond the limit of 39? What will we get?

The next values of f(x) in this series would be 1681, 1763, 1847, 1933, 2021, 2111, 2203, 2297, 2393, … .
Are all these prime numbers too? The answer is no. 1681 is not a prime number, neither are 1763 and 2021. Though all others (in above sequence at-least) are prime numbers.

Total
0
Shares


Feel free to ask questions, send feedback and even point out mistakes. Great conversations start with just a single word. How to write better comments?
2 comments
  1. I believe I have a formula far better than Euler’s formulae. It will generate consecutive primes from 2 to 7993. Here is the
    formula: factor(product(2*i,i,1,8000)); written in Maxima software. Try it. What do you think?

  2. Here is a shortened version tor pagination problem:
    Numerical example:
    product(i,i,1,20);
    2432902008176640000
    factor(product(i,i,1,20));
    2^183^85^47^2111317*19
    cadd(m)::=[ppp:factor((m)^2),zzz:(makelist(part(ppp,k),k,1,length(ppp))),xxx:factor(zzz),yyy:makelist(first(part(xxx,j)),j,1,length(xxx))]$
    cadd(2432902008176640000);

    Output: ...........................,[2,3,5,7,11,13,17,19]]

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.

You May Also Like

Four way valid expression

People really like to twist the numbers and digits bringing fun into life. For example, someone asks, “how much is two and two?” : the answer should be four according to basic (decimal based) arithmetic. But the same  with base three (in ternary number system) equals to 11. Two and Two also equals to Twenty Two. Similarly there are many ways you can…
How Genius You are
Read More

How Genius You Are?

Let have a Test: You need to make a calculation. Please do neither use a calculator nor a paper. Calculate everything “in your brain”. Take 1000 and add 40. Now, add another 1000. Now add 30. Now, add 1000 again. Add 20. And add 1000 again. And an additional 10.   So, You Got The RESULT!  Quicker you see the…
px Gregory XIII
Read More

Calendar Formula: Finding the Week-days

This is the last month of the glorious prime year 2011. We are all set to welcome upcoming 2012, which is not a prime but a leap year. Calendars have very decent stories and since this blog is based on mathematical approach, let we talk about the mathematical aspects of calendars. The international calendar we use is called Gregorian Calendar,…
mobile number is prime number
Read More

My mobile number is a prime number

My personal mobile number 9565804301 is a prime number. What is a prime number?$ Any integer p greater than 1 is called a prime number if and only if its positive factors are 1 and the number p itself. In other words, the natural numbers which are completely divisible by 1 and themselves only and have no other factors, are called prime numbers. 2$ ,$ 3$…

Hopalong Orbits Visualizer: Stunning WebGL Experiment

Just discovered Barry Martin’s Hopalong Orbits Visualizer — an excellent abstract visualization, which is rendered in 3D using Hopalong Attractor algorithm, WebGL and Mrdoob’s three.js project. Hop to the source website using your desktop browser (with WebGl and Javascript support) and enjoy the magic. PS: Hopalong Attractor Algorithm Hopalong Attractor predicts the locus of points in 2D using this algorithm…
Read More

Applications of Complex Number Analysis to Divisibility Problems

Prove that $ {(x+y)}^n-x^n-y^n$ is divisible by $ xy(x+y) \times (x^2+xy+y^2)$ if $ n$ is an odd number not divisible by $ 3$ . Prove that $ {(x+y)}^n-x^n-y^n$ is divisible by $ xy(x+y) \times {(x^2+xy+y^2)}^2$ if $ n \equiv \pmod{6}1$ Solution 1.Considering the given expression as a polynomial in $ y$ , let us put $ y=0 $ . We…