Conjecture wise: the deliberate use of the equals sign denotes that a prime that is divisible by all other primes before the last is a theorem proof…For example, use 1 as your base prime. Carry that value to an elevated exponent of your choice…preferably less than 3,500,000. Subtract that value by the least square (root) of the most frequent integer…Whole values are the key…more specific to the ratios that occur when 1 is observed…meaning a total loss of f(1) = f(2) = 1.