ABSTRACT :
By grouping
all the odd numbers greater than two into groups in modulo prime for all odd primes ≤ (E-3)^(1/2) (E
= even number), we will get a special pattern that leads the lose of odd pairs
which is not a prime pairs. With this method, we will create a base formula
as an approximation to the number of prime pairs. Here, the formulation is
focused on the even numbers that are critical (I refer to as the critical
condition on all steps = CCAS). However,
the actual initial state is in an unbalanced condition. Then, the balance
and the tolerance are given in several different ways to obtain the minimum
limit (lower bound) to the number of prime pairs as a guarantor formulation on
the proof.
Several formula are drawn into graphics for very limited even numbers as shown on both graphs.
The formulation theoretical :
No comments:
Post a Comment