Let p be a prime that does not divide b.

Let p and q be coprime integers, greater than or equal to two.

On the other hand we can prove Theorem 2.4.6 Let p be a positive prime.

Let p be a point on the clipping plane E.

Initially, let p equal 2, the first prime number.

Otherwise, let p now equal this number (which is the next prime), and repeat from step 3.

Let p be an odd prime number and a an integer.

Let p be an odd prime and H a finite group.

If and have different parity, let p be any factor of such that .

Let p be the part of the root found so far, ignoring any decimal point.