Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 5.6.12 (Value of $\nu_7(Z_n)$, where $X_n^3 + Y_n^3 = 7Z_n^3$)
Exercise 5.6.12 (Value of $\nu_7(Z_n)$, where $X_n^3 + Y_n^3 = 7Z_n^3$)
Let the triple of integers be defined as in the proof of Theorem 5.16. Show that the power of dividing tends to infinity with .
Answers
Proof. For some unknown reason, this result seems false, because for any value of .
| 0 | 2 | 1 | 1 |
| 1 | 20 | 32 | 7 |
| 2 | 34 | 25 | 35 |
| 3 | 41 | 46 | 28 |
| 4 | 20 | 32 | 42 |
| 5 | 34 | 25 | 14 |
| 6 | 41 | 46 | 21 |
| 7 | 20 | 32 | 7 |
Thus
By induction, for all ,
therefore, for any and for any
So every is congruent modulo to some , where . By the preceding array, for , but . Therefore
This contradicts the statement. □
With Sagemath:
def triple_mod(n): x, y, z = 2, 1, 1 for i in range(n): x, y, z = (x * (x^3 + 2 * y^3)) % (7^2), (-y * (2 * x^3 + y^3)) % (7^2), (z * (x^3 - y^3)) % (7^2) return (x,y,z) print([triple_mod(n) for n in range(8)]) [(2, 1, 1), (20, 32, 7), (34, 25, 35), (41, 46, 28), (20, 32, 42), (34, 25, 14), (41, 46, 21), (20, 32, 7)]