Professional Documents
Culture Documents
Abstract :
f (x)x+2 2 2 2
x=3 = (x ) − (1 ÷ (1 − (x − 1 − x ) ÷ −2)) + 1 − 2 + x ÷ x ÷ 2
What does this mean? It means that for any arbitrary odd number x ÷ 2
always divides with f (x) the result is a prime number, or a composite number
of relatively small prime numbers.
Important Note : only if the result of the function f (x) is an odd number,
the rule is valid.
Introduction :
Conclusions :
I invite you to read the results and try a simple program written in Python
language file.py
1
Important relationship between this function f (x) and the prime numbers of Mersenne, precisely
the exponent of mersenne 2^(factor f(x) )-1:
f(x)=6
Mp = 2^2-1=3
(' InsertNumber=---->', 2)
(' f(x) = Number= ---->', 6.0)
6.0=1*2*3
f(x)=51
Mp = 2^3-1=7
(' InsertNumber=---->', 7)
(' f(x) = Number= ---->', 51.0)
51.0=1*3*17
f(x)=975
Mp = 2^5-1=31
975.0=1*3*5*5*13
f(x)=16191
2^7-1=127
16191.0=1*3*3*7*257
Factors of 16191 are four ,and the number 7 is the exponent of mersenne.
f(x)=67096575
67096575.0=1*3*3*5*5*7*13*29*113
f(x)=17179672575
Mp= 2^17-1
17179672575.0=1*3*5*5*13*17*37*109*257
f(x)=274877120511
Mp = 2^19-1 = 524287
274877120511=1*3*3*3*7*17*19*73*61681
f(x)= 4611686015206162431
Mp = 2^31-1 = 2147483647
4611686015206162431=1*3*3*7*11*31*151*331*641*6700417
CountNumber=0
InsertNumber=1
Number=0
Count=2
CountEnter=0
Formula=0
Factor=str(Number)+"=1"
print('Helloword \n\n')
Count=2
#NF=(ab**2)-(1/(1.0-(ab-1-ab**2)/-2.0))+1-2+ab**2*1.0/ab/2*1.0
Formula=(InsertNumber**2)-(1/(1.0-(InsertNumber-1-
InsertNumber**2)/-2.0))+1-2+InsertNumber**2*1.0/InsertNumber/2*1.0
Number=Formula//1.0
Factor=str(Number)+"=1"
InsertNumber=InsertNumber+2
while Number>=Count:
if Number%Count==0:
Factor=Factor+'*'+str(Count)
Number=Number/Count
else:
Count=Count+1
print Factor
Helloword