Let us suppose thatis a rational number. Then we can write = , where and are whole numbers. We can assume that the numbers and have no common divisor. Otherwise, we can cancel this common divisor in the numerator and denominator. Raise both sides of the equality = in the degree 3. You will get = . Hence, = . The right side of the last equality is divisible by . Hence, its left side is divisible by also. Since is divisible by , the whole number itself is divisible by . So, we can write = , where is another whole number. Now, substitute = into = . It gives = . Cancel both sides by . You will get = . The left side of the last equality is divisible by . Hence, its right side is divisible by also. Since is divisible by , the whole number itself is divisible by . We just got a contradiction. We assumed that = , where and are whole numbers with no common divisor, and the chain of arguments led us to the conclusion that both the integers and have the common divisor . This contradiction proves that the original assumption was wrong, regarding as a rational number. Hence, is irrational. The proof is completed. In the proof we used many times this property of the number 7: if 7 divides the product of two integers m and n, then 7 divides at least one of the integers. It is the common property of any prime number in the ring of integer numbers.