User talk:Nuclearstrategy8

Prime Number Distribution Series

For a long time, when all the prime numbers up-to some given number were evaluated, it was expected that its 'distribution'/'count off' must/can be represented by a simple analytical function. The distribution of prime numbers is indeed be a pattern related phenomenon but the means that pattern has been sought is misguided/ill-advised, according to Yoldas Askan, a British scientist and mathematician. In his paper, Yoldas challenges some of the fundamental understanding of Prime Numbers and reconsiders these definitions, and ultimately arrives at his analytical formula. In his view, there is no great deal about functions that are approximations because there can be infinitely many of these derived but only suitable at certain number interval. Yoldas claims that the 'beautiful' thing about the Prime number distribution is that there will be no analytical function [of any complexity] that will compute and provide exact values for π(x) other than the Prime Number Distribution Series, which is provided as follows, where,

Sx and SY are base primes, (5 × 5), (5 × 7), (7 × 7) and (7 × 11) i, j = 0, 1, 2…, D is a constant equal to either 0 or 1 such that provides for integer solutions to P'n, E is a constant equal to +/-1 (positive for P1 and P2 and negative for P3 and P4). To prove that the formula works and it is not a sieving tool, Yoldas provides the software code that implements the Prime Number Distribution Series. Furthermore, by exploiting previously unknown tools in combinatory mathematics Yoldas can count π(1e25) in less than 10 seconds on an average personal computer.