- Get link
- X
- Other Apps
Let (1+√2)2012=a+b√2, where a and b are integers. What is the greatest common divisor of b and 81?
Source: 2011-2012 SDML High School 2a, problem 15.
Let (1+√2)n=an+bn√2. I've thought about this some more, and there's a nice way to describe the highest power of 3 that divides bn. This is probably outside of the scope of the intended solution, however.
First note that (1−√2)n=an−bn√2, and so from (1+√2)(1−√2)=−1 we get (1+√2)n(1−√2)n=(−1)n. This gives an2−2bn2=(−1)n. Now define the highest power of a prime p that divides n to be νp(n).
From cubing and using the above result it's straightforward to prove that if ν3(bn)=k>0 then ν3(b3n)=k+1.
Note (1+√2)4=17+12√2≡−1+3√2(mod32). Cubing and using the first formula as before, we can in fact show that (1+√2)4⋅3n≡−1+3n+1√2(mod3n+2), and squaring we also have (1+√2)8⋅3n≡1+3n+1√2(mod3n+2). Now assume ν3(bm)=k,ν3(bn)=l and k≠l. From the top formula if 3|bi then 3⧸|ai, and it follows that ν3(bm+n)=min(k,l).Putting this all together, write n=4⋅m+k, where 0≤k<4. If k≠0, then ν3(bn)=0. If k=0, let the base-3 expansion of m be ai⋅3i+…+a0. Then ν3(bn)=minaj≠0j+1.
For n=2012, we have 2012=4⋅503=4⋅(2⋅35+32+2⋅3+2) and so ν3(b2012)=1. We don't actually need to compute the entire base-3 expansion for 503, of course; we only need to observe that it's not divisible by 3.
For n=2016, we have 2016=4⋅504=4⋅(2⋅35+2⋅32) and so ν3(b2016)=3.
Source: 2011-2012 SDML High School 2a, problem 15.
Let (1+√2)n=an+bn√2. I've thought about this some more, and there's a nice way to describe the highest power of 3 that divides bn. This is probably outside of the scope of the intended solution, however.
First note that (1−√2)n=an−bn√2, and so from (1+√2)(1−√2)=−1 we get (1+√2)n(1−√2)n=(−1)n. This gives an2−2bn2=(−1)n. Now define the highest power of a prime p that divides n to be νp(n).
From cubing and using the above result it's straightforward to prove that if ν3(bn)=k>0 then ν3(b3n)=k+1.
Note (1+√2)4=17+12√2≡−1+3√2(mod32). Cubing and using the first formula as before, we can in fact show that (1+√2)4⋅3n≡−1+3n+1√2(mod3n+2), and squaring we also have (1+√2)8⋅3n≡1+3n+1√2(mod3n+2). Now assume ν3(bm)=k,ν3(bn)=l and k≠l. From the top formula if 3|bi then 3⧸|ai, and it follows that ν3(bm+n)=min(k,l).Putting this all together, write n=4⋅m+k, where 0≤k<4. If k≠0, then ν3(bn)=0. If k=0, let the base-3 expansion of m be ai⋅3i+…+a0. Then ν3(bn)=minaj≠0j+1.
For n=2012, we have 2012=4⋅503=4⋅(2⋅35+32+2⋅3+2) and so ν3(b2012)=1. We don't actually need to compute the entire base-3 expansion for 503, of course; we only need to observe that it's not divisible by 3.
For n=2016, we have 2016=4⋅504=4⋅(2⋅35+2⋅32) and so ν3(b2016)=3.
Comments
Post a Comment