The segregation law of integers.

There are no prime numbers in the group of integers.

There are many ways to introduce numbers. And sometimes somebody asked. Can we find prime numbers from the group of integers? Let’s take the simple integer “2” and try to determine if it is a prime number. The proposition is that: “There are no prime numbers in the group of integers”. The integer can be a prime number only if the use of decimals is not allowed. 

2=0,5*4

2=0,4*5

2=6*0.33333333333

This means that the number 2 is not a prime number. 

Let’s take number 1. 

1=0,5*2

1=0.33333333333*3

1=0,25*4

This means that it's impossible to find a real prime number in the group of integers. The only real prime numbers are in decimal numbers. And that makes prime number calculations interesting. The problem with the first number one is that we can always introduce all other numbers in as a group of ones. Number one doesn’t participate in any multiplication calculations or division calculations. Or it cannot change the answer. 

3*1=3

3/1=3

But it's possible to remove one from the number.  Like this:

3=1+2

This means that even if the number one cannot change answers or the number that we want to divide or count, it involves all numbers, if they are integers.

Today, the most important tool to calculate prime numbers is the Reimann Zeta function. That is used in the cryptological processes for prime number generation. 

https://en.wikipedia.org/wiki/Riemann_hypothesis

https://en.wikipedia.org/wiki/Riemann_zeta_function