Floor of Prime Raise to Power Half

A prime number is a positive integer that has exactly two distinct positive integer divisors: 1 and itself. Let P(x) denote the prime number function such that P(x) returns the xth prime number. Here x is any positive integer. I wanted to construct a function of P(x) as f(P(x)) such that for x incrementing by one, f(P(x)) will return an understandable ordered pattern. Instead of constructing such function by hit and trial, I decided to construct using logics. The logic I used was that for f(P(x)) to return an understandable ordered pattern, when supplied with seemingly unordered pattern of prime numbers, the function f should know the concept of prime numbers. The function will know the concept of prime numbers if it knows the meaning of numbers without fractional part. This as concept of prime numbers is based on the concept of numbers without fractions. Hence I decided that the function will contain the floor function. Floor function floor(x) returns the greatest integer less than or equal to x. Floor function will have an effect only if its applied on numbers with fractions. I knew that one way of checking the primality of a number, is to check its divisibility by all integers from 2 till its square-root. Hence, I made the required function f(P(x)) as floor( ( P(x) ) ^ (1/2) ), which I denote as fph(x), acronym for Floor of Prime raise to power Half. Obviously, here also, x is any positive integer. The symbol ^ is being used as raise to power; a^b is denoting a raise to power b. When I plotted y=fph(x) on computer screen with y as the vertical axis and x as the horizontal axis, and each pixel equal to one unit in both x and y directions, the following plot was obtained:

It can be observed that y=fph(x) is a curve similar in shape to say, y=floor(x^(1/2)) curve. From y=fph(x) plot, it can also be observed that: (1){ fph(x+1) - fph(x) = 0 or 1, for all positive integral values of x. }(1) Also from the trend of y=fph(x) plot, it can be observed that: (2){ For every positive integer N, there exist at least two values of x such that N=fph(x). }(2) Like for N=1, two values of x are 1 and 2, for N=7 there are three values of x satisfying 7=fph(x), these are x=16, 17 and 18. Obviously, for a particular N, values of x satisfying N=fph(x) are consecutive and also number of values of x satisfying N=fph(x) are finite.

Page 1 of 6

Let M be any one particular case of N. So M is also a positive integer. For M, let any two of the at least two values of x be x1 and x2. Let P(x1) be denoted as P1 and P(x2) be denoted as P2. Value of both floor( (P1)^(1/2) ) and floor( (P2)^(1/2) ) is equal to M, hence values of both (P1)^(1/2) and (P2)^(1/2) will lie between M and (M+1), with M and (M+1) excluded. This implies that values of both P1 and P2 will lie between M^2 and (M+1)^2, with M^2 and (M+1)^2 excluded. This can be stated as: (3){ Between the squares of any two consecutive non-zero integers, there exist at least two prime numbers. }(3) It has just been shown that between M^2 and (M+1)^2 there exist at least two prime numbers. Similarly between (M+1)^2 and (M+2)^2 there will also exist at least two prime numbers. Hence between M^2 and (M+2)^2 there will exist at least four prime numbers. Proceeding this way, statement (3) can be extended to: Between M^2 and (M+m)^2 there exist at least 2*m prime numbers, where both M and (M+m) are any two positive integers. 2*m signifies: 2 multiplied by m. If statement (2) is extended to: For every integer N greater than or equal to integer n, there exist at least v values of x such that N=fph(x). If this extended statement is considered true, then: (4){ For every real value of v which is not positive infinity, there exist infinite values of n. }(4) Out of these infinite values of n, let n be the least possible value for the given v. Then obviously, all n for the given v are all the integers greater than or equal to n. Values of N can exist even for N<n , such that there exist at least v values of x satisfying N=fph(x). For example, for v=6, n is equal to 18 ; and for N=15, there are six values of x satisfying N=fph(x) ; for N=16, there are seven values of x satisfying N=fph(x). Let a function called lfph(N) , denoting Length fph, be defined such that lfph(N) returns the number of values of x satisfying N=fph(x). Then lfph(1)=2 , lfph(7)=3. Observe that y=fph(x) plot is constituted of horizontal lines. These horizontal lines are formed when value of fph(x) is constant for varying x. For x=16, 17 and 18, y=fph(x) is a horizontal line with y=7. lfph(N) can also be understood as length of Nth horizontal line in y=fph(x) plot. Thus, length of first horizontal line = lfph(1)=2 , length of seventh horizontal line = lfph(7)=3. The values of lfph(N) for N=1 to 27 are: 2,2,2,3,2,4,3,4,3,5,4,5,5,4,6,7,5,6,6,7,7,7,6,9,8,7,8 Consistent to statement (2), for N being any positive integer, the least value of lfph(N) is two.

Page 2 of 6

When I plotted y=lfph(N) on computer screen with y as the vertical axis and N as the horizontal axis, and each pixel equal to one unit in both y and N directions, the following plot was obtained:

Observe that the given plot of y=lfph(N) can be closely bounded by two curves f1(N) and f2(N) such that f1(N) < lfph(N) < f2(N). Also observe that if any horizontal line y=v is drawn on the y=lfph(N) plot, v being any real number which is not positive infinity, then there will always exist integral values of n such that for N=n,n+1,n+2,n+3 uptil infinity, lfph(N) >= v. This is equivalent to statement (4), hence statement (4) is verified. Now, will line y=v always meet somewhere with y=lfph(N) for any integral value of v greater than or equal to two? I checked it for a range of values and found that yes it always coincides, at least at two points, hence: (5){ For v being any integer greater than or equal to two, there exist at least two values of N such that v=lfph(N). }(5) This can be equivalently said as (in a shorthand manner): In y=fph(x) plot, all integral lengths greater than or equal to two exist, at least twice. By statement (4), it implies that: For a particular v, number of values of N satisfying v=lfph(N) are finite. This is automatically deduced but still here Ive made up an explanation: We have seen that for every real value of v which is not positive infinity, there exist infinite values of integer n such that for every integer N greater than or equal to n, there exist at least v values of x such that N=fph(x). Let the least possible value of n, n be found for this v. Let any value w exist which is less than v. Now, no value of N>=n satisfies w=lfph(N). There are finite number of values of N from 1 to less than n ; converting w to v, its proved that for a particular v, number of values of N satisfying v=lfph(N) are finite. This can also be observed from the y=lfph(N) plot. Let a function called clfph(v) be defined such that clfph(v) returns the Count of N satisfying v=lfph(N). Consistent to statement (5), for v being any integer greater than or equal to two, the least value of clfph(v) is 2. Continuing further, let a function called cclfph(v1) be defined such that cclfph(v1) returns the Count of v satisfying v1=clfph(v). Value of cclfph(v1) appears to be infinity for many finite values of v1. Like for v1=2, cclfph(v1) appears to be infinity, cclfph(3) appears to be infinity et cetera. Thus, here I stop forming stages of count functions.
Page 3 of 6

To verify statement (1), I plotted y = ( (P(x+1))^(1/2) ) - ( (P(x))^(1/2) ), denoting it as dph(x) , Difference of Prime raise to power Half, or also as ph(x+1) - ph(x), where ph refers to Prime raise to power Half. I plotted y=dph(x) on computer screen with y as the vertical axis and x as the horizontal axis, and each pixel along x axis equal to one unit and each pixel along y axis equal to (1/300) of a unit. The following plot was obtained:

The y=dph(x) plot is constituted of various waves resembling the shape of y= ( sqrt(x+k) - sqrt(x) ) where k is any positive real number constant. sqrt(x) refers to square-root of x. Each individual wave in the y=dph(x) plot contains particle(s) corresponding to those values of x for which the value of (P(x+1) - P(x) ) is same. The second lowest wave is containing the particles corresponding to xs for which (P(x+1) - P(x) ) = 2. At the lower left side of this wave, lies the lowest wave, corresponding to x for which (P(x+1) - P(x) ) = 1. Obviously, this wave contains only one particle; it corresponds to x=1. As the value of x increases, the particles of waves in y=dph(x) plot seem to settle down, with the highest point of y=dph(x) plot being at x=4. This point is marked by an arrow in the given plot. P(4) is 7 and P(4+1) is 11. Thus value of dph(4) = sqrt(11) - sqrt(7). As the highest point of y=dph(x) is known, hence: (6){ sqrt (P(x+1)) - sqrt (P(x)) <= sqrt(11) - sqrt(7) The equality holds for only one value of x i.e. x=4 }(6) As sqrt(11) - sqrt(7) is less than one, hence floor( sqrt (P(x+1)) ) - floor( sqrt (P(x)) ) is always equal to either 0 or 1. Heres the explanation: Let sqrt(P(x)) be equal to (I1 + f1) where I1 is the integral part and f1 is the fractional part. Similarly let sqrt(P(x+1)) be equal to (I2 + f2) where I2 is the integral part and f2 is the fractional part. Here I1,I2,f1,f2 all are positive. sqrt (P(x+1)) - sqrt (P(x)) <= sqrt(11) - sqrt(7) , and also sqrt(11) - sqrt(7) is less than 0.68, hence: (I2 + f2) - (I1 +f1) < 0.68 => I2 - I1 < 0.68 + (f1 - f2)

Page 4 of 6

As f1 and f2 both are fractions, -1 < (f1 - f2) < 1 Substituting it in I2 - I1 < 0.68 + (f1 - f2) , we get: I2 - I1 < 1.68 => floor( sqrt (P(x+1)) ) - floor( sqrt (P(x)) ) < 1.68 As (P(x+1)) > P(x), floor( sqrt (P(x+1)) ) - floor( sqrt (P(x)) ) cant be negative. => floor( sqrt (P(x+1)) ) - floor( sqrt (P(x)) ) is always equal to either 0 or 1. Hence statement (1) is verified. Statement (6) can also be written as: P(x+1) <= ( sqrt(P(x)) + sqrt(11) - sqrt(7) )^2 Statement (6) can be generalized to: (P(x+1))^c - (P(x))^c <= d Then specific values of x and/or c and/or d and/or some other variable(s) can be found out for specific problems. One such problem can be to find the maximum real value c, satisfying for all positive integral values of x, such that for all real values of c less than c , minimum value of d is not infinity. This problem can also be stated as to find the minimum real value c, satisfying for all positive integral values of x, such that for c= c , minimum value of d is positive infinity. As arbitrarily large prime gaps exist, thus for c=1, minimum value of d is positive infinity. Also, for c=0.5, minimum value of d is: sqrt(11) - sqrt(7). Hence c is greater than 0.5 and less than or equal to 1. The minimum value of the expression (P(x+1))^c - (P(x))^c is obtained at x=1 ; minimizing 3^c - 2^c, we obtain c = ( log( (log 2) / (log 3) ) ) / log(3/2) and obtain the minimum value of (P(x+1))^c - (P(x))^c as approximately equal to -0.1679.

Page 5 of 6

Let a function fpc(x,c) , denoting Floor of Prime raise to power c, be defined such that fpc(x,c) = floor( ( P(x) ) ^ c ). Here c is any real number. Statement (1) says, when c=(1/2), fpc((x+1),c) - fpc(x,c) is always equal to either zero or one. I wanted to find constants c1 and c2 where: c1 is the largest real number such that for real number c approaching c1 from the left, fpc((x+1),c) - fpc(x,c) is always equal to either zero or one, for all positive integral values of x. Approaching from left is being used as: if a approaches b from the left then value of a increases as it approaches b. c2 is the largest real number such that for all values of c less than c2, where c is a real number, fpc((x+1),c) - fpc(x,c) is always equal to either zero or one, for all positive integral values of x. I programmed algorithms to find the values of c1 and c2. Value found for c2 was approximately 0.57235. At a slight increase in value of c2 from 0.57235, fpc(x+1,c2) - fpc(x,c2) becomes equal to 2 for x=30. P(30)=113 and P(31)=127. When c2=0.57235, value of 127^c2 is just below 16 and value of 113^c2 is just below 15. When value of c2 is slightly increased from 0.57235, 127^c2 first crosses 16, while 113^c2 stays below 15. Hence, fpc(31,c2) - fpc(30,c2) becomes equal to 2. The exact value of c2 can be obtained by equation: 127^c2=16, therefore: (7){ Value of c2 is log(16) / log(127) }(7) Value found for c1 was approximately 0.646. Both for some increase in value of c1 and decrease in value of c1 from 0.646, fpc((x+1),c1) - fpc(x,c1) becomes equal to 2 for some value(s) of x. We are interested in finding the largest value of c1, hence well bring increase in the value of c1. With slight increase, fpc((x+1),c1) - fpc(x,c1) becomes equal to 2 for x=189. P(189)=1129 and P(190)= 1151. Similar to when c2 was being found out, here 1151^c1 first crosses an integer, the integer being 95, therefore: (8){ Value of c1 is log(95)/log(1151) }(8)

Page 6 of 6