BRIEF VIEW OF PRIME MEMBERS

Ing. Antonio Gutierrez Santa Cruz Bolivia - 2014

Before entering the subject, it will, be put same elementary facts, due that the paper is referred to a main public and mathematicians as well. A set is a logic entity or associations of sets, which indicates things, objects, ideas of situation or belongings, etc. and it will be referring to then as convenience. One (1) which mean, identity non- plurality, direction, metric, set off only object etc. that with the two mathematic rules addition (+) and multiplication (x) forms a set (additive and multiplicative) not close. Call cardinal (n a succession 1+1=2, 1+1+1=3; 1+1+1+1=4n ) this set will be call positive natural numbers n. Let see a set n, which will covers the geometrics line, say exits a relation between them, with this it can be say that exist a covering between the straight line and a set n. Then the even numbers which general forms is 2n, multiples of a factor generator, divisor two, which with the afternoon mentioned law form a set. The numbers of the form Xp= 2n (xp even) The numbers of the form Xpi = 2n+1 (xpi odd) The so called odd numbers, form two sub-sets, the odd itself which are multifactor, multigenerator, and the prime numbers. Let see some examples of even numbers. Xp=2 some 1,2,3,4n Under the product law (x) Xp= 2*2*2* times 1,2,3,4n Xp=2*2=4 2*3=6 2*4=8 etc. also

4 2 2 2 1

8 2 4 2 2 2 1

108 54 27 9 3

2 2 3 3 3

98 2 49 7 7 7 1

Under the sum law (+) 4=4 4=3+1 4=2+2 4=2+1+1 etc

Say in the first case, it is a series of factors that made the numbers, due that they are irreducible and form given segments. In the second case it gives a set a numbers that have a common origin due to the fundamental axiom of the arithmetic 1+1+1=3n The odd numbers Xpi = 2n+1 In which the aforementioned are constitutes of unique factor, but also it can be. 1+1+1+1+5=9; 1+1+1+6=9; 1+1+7=9; 2+7=9; 2+2+5=9, etc. Say all odd number is not divisible between two. Now the number of the form 2n+1= xpp with only one factor, monogenerator , whole divisor are: 3 3 1 5 5 1 7 7 1 11 11 1 41 41 etc. 1 can be express

Althoug h with the law (+) 1+1+1+1+1=5; 1+1+1+2=5 etc.

Then the prime number can be expressed. 1*0+2=2 1*1+2=3 1*3+2=5 1*5+2=7 1*7+4=11 1*11+2=13 2v1+0=2 2v1+0=3 2v2+0=5 2v3+0=7 2v5+0=11 2v6+0=13

1*13+4=17 Etc.

2v8+0=17 etc.

Where v mean adding 2,1,2,3,4 times given the mentioned number, which is a synthesis of 2n. Now each prime number is equal to its preceding one plus the positional difference, and gives a cardinal number. An oven number bigger than 2 is formed adding two odd number due that its positional difference is always on even number. Now take an odd number and add 1 etc, comes: 105 35 7 3 5 7 106 53 1 2 53 106=83+23 106=53+53 etc. 102=79+23 etc.

It is num that 105 and 106 have not any common factors. Now a number is call perfect if is equal to the sum of its factor. 28=14+7+4+2+1 Also it can be number cues perfects which are lacking of one unit to be perfect. Then it is seen that 608= 29+579 602=23+579 etc.

Say a even number is equal to the same prime numbers +o- a positional numbers. With this previous statements it can be consider.

2 0 1 3

4 5

6 7

8 9

10 11

12 13

14..n

And with an implification of the first part of this line

1/7

1/5

1/3

1n

And converting this fractional numbers in negative ones, the real straight line of n can be ready to apply the following

X= number to be consider X dp= density of 2m digit modulus N1= 1,3,5,7,9.. n etc. N2= root (16 ) nt the succession 1/3, 1/5, 1/7, 1,2,3,4,5,6 etc Before doing a functional analysis it can be said that it be referring mainly to the counting system of base 10, less is stated directly. Which it then be sataled Xdp= f(x)(2m)(yo1) And In which y01= y0n1n2 Also ( ) xpip (prime numbers)

Then yon1 and for reference it will be call

1 2 3 4 5 6 7 8 9 10 11 12

1/7=0.01963828405 1/5=0.02749359767 1/3= 0.04582266279 1=0.13746798838 3=0.41240396514 5=0.6873329419 7=0.96227591866 9=1.23721189542 11=1.51214787218 13= 1.78708384894 15=2.0620198257 17=
M= digit modulus 10=1; 100=2; 1000=3; 10000=4, etc. n2

-1/7= -0.88548533396

-1/5= -0.90430383939 -1/3= -0.93364101391 1= 1.000000 2= 1.04427378242 3=1.07107548306 4=1.09050773266 5=1.10582301702 6=1.11849604596 7=1.12932418146
Where it can be obtained: y on1n2

1 2 3 4 5 6 7 8 9 10

-0.01738941251 -0.02486256593 -0.04278191734 0.13746798838 0.43066264858 0.73619296029 1.03067014441 1.30925495466 1.69133141594 2.0181970049

Then for 2m - y on1n2

1 = 1.98261058749 2 = 3.97503743407 3 = 5.95721808266 4 = 8.13746798838 5 = 10.43066264858 6 = 12.73619296029 7 = 15.03067014441 8 = 17.30925495466 9 = 19.69133141594

10= 22.0181970049 .etc

And with this values it can be obtained

X 10 100 1000 10000 100000 1000000 10000000 100000000 1000000000 10000000000

5.043855 25.1569957915 167.863587688 1.228.888168607 9.587.11861076 78.516.3983558 665.306.330584 5.777.256.17089 50.783.767.6833 454.169.794.092

x 4 25 168 1.229 9.592 78.498 664.579 5.761.455 50.847.534 455.052.512

Here x are values of density obtained with direct calculus, it can be see if a general formula is applied to monogenerator base it cames.

It sap have only one prime number and is the number one Whit the previous exposed the theorem of the prime numbers can be applied to the expression

Which is not a good approach, due that is not more than an equivalent formula, that gives only a density of the prime numbers then let see another things about prime numbers, the demonstration of the existence of a greather prime number by the Reducto and Absurdion (Due to Euclid) is not such due that supposing the existence of a set C= P1,P2,P3,P4,Pn then a second set n= P1,P2,P3,P4,Pn +1 If it is subtracted c-n=1 and not a higher prime, both of the set are disjoint and covers the straight line in different partitions, then its uses to demonstrate the existence of higher prime number is inadequate.

C= 15 5

3 5 1

is a number of this primes 3,5

H= 16

2 8 4 2 1

is a prime number of 2*2*2 etc. 2 2 2

That have not any relation with the previous prime number, with not even the some numbers. More logic is referring to the elemental axiom of arithmetic witch sign: 1+1+1+1+1=5; 1+1+1+1+1+1+1=7 etc.

Then it is taken a bigger segment of straight line (n) which always can have a major portion of xpp With the previous said, it seen that the theorem of the prime numbers, it does not express the formation of them, and the import thing is how are they form and their evolution. Any prime number it is equal to it predecessor plus it differential position is 11 dif 2= 13 dif 4= 17 etc. This can be a good base for a theorem of the prime numbers. As early was said table1 the prime numbers Xpp= 2n+1; xpp1= xpp+2 o 4 etc.

The Goldbach guess is one that sup that a even number bigger than 2 is equal to the addition of two prime numbers. By natural induction it is:

3 31 34

5 29 34

11 23 34

17 17 34 etc.

Table 2 A prime number Xpp= 2n +1 +2n+1 (xpp) there are no more than segments of the straight line which gives 2n+2n+2 that also is even going further with the induction trans finite it can be (2n+1)+1+(2n+1)+1=2n+2n+4 also an even number, applying the elementary algorithmic of arithmetic i.e. 2n=1+1+1+1 y 2n=1+1+1+1+1+1 plus 1+1 form a segment of 12 and it is added 1+1 gives and argument of 14, that we my variation of 2nwill gives always an even argument. How be granted the existence of prime number, even if the density of the number are diminish? There wont be a lacks of a prime number due that they compensate the diminution of then by increasing the number of combination of small and big prime numbers, which covers the straight line in different proportions. Say x= xpp. (2m+ y01)take the m values of 2,4,6,8,10,etc. Also the primes different value with the addition of one minimus number added to the maximizes, or and equal prime number: 17+17=34 etc.