wredulus_pospolitus:
'harówka' :
1. n−1 > 0 −−−> n ≥ 2
2. n−1 < n+1 −−−> (n+1) musi dzielić 9 lub (n+1) musi dzielić 9*NWD(n−1 , n+1)
| | ⎧ | 1 dla n = 2k | |
| 3. NWD(n−1, n+1) = | ⎩ | 2 dla n = 2k+1 |
|
stąd: n+1 = 3, 2*3, 9 , 2*9 −−−> n = 2, 5, 8, 17
'na cwaniaka' :
| | 9(n−1) | | 9(n+1 − 2) | | 18 | |
an = |
| = |
| = 9 − |
| |
| | n+1 | | n+1 | | n+1 | |
| | 18 | |
1. |
| < 9 −−−> n+1 > 2 |
| | n+1 | |
stąd: n+1 = 3, 6, 9 , 18 −−−> n = 2, 5, 8, 17