Multiplication tables for non-prime odd numbers The untouched tables which will give us a better understanding of the distribution of prime odd numbers [post]

ahmad hazaymeh
2020 unpublished
The sieve method is used to separate prime numbers from non-prime numbers. If the set of prime odd numbers cannot be written as multiplication tables, the set of non-prime odd numbers can be written as multiplication tables. Thus, each odd number that does not appear in these multiplication tables is certainly a prime odd number. Based on these tables, it was proved by the opposite method that the series of prime numbers are random series. Although they are random, they can be easily tracked
more » ... ng the opposite method. The counter-example is used to proof that it is not possible to write whole multiplication tables of prime odd numbers on formula of [(𝑎×𝑏)+𝑐] or [(𝑎×𝑏)−𝑐]. Instead, partial multiplication tables can be used. It also was proved that the number 1 is a prime odd number.
doi:10.31221/osf.io/34vgk fatcat:riitmoek2jbylgpdhlqtibwvwq