|
||
Title: Add To Power And Divide, Get Integer? Post by K Sengupta on Aug 6th, 2007, 8:20am Analytically determine whether for every positive integer P, there always exists a positive integer Q such that 3Q+5 is divisible by 2P |
||
Title: Re: Add To Power And Divide, Get Integer? Post by Eigenray on Aug 6th, 2007, 8:51am [hide]yes[/hide]: [hideb]We prove by induction that for P http://www.ocf.berkeley.edu/~wwu/YaBBImages/symbols/ge.gif 3, there is a Q such that 3Q+5 is divisible by 2P, and no larger power. Suppose that 3Q + 5 = t*2P, where t is is odd. Then we need to find Q' = Q+R such that 3Q' + 5 = 3R(t*2P - 5) + 5 http://www.ocf.berkeley.edu/~wwu/YaBBImages/symbols/equiv.gif 2P + (3R - 1) http://www.ocf.berkeley.edu/~wwu/YaBBImages/symbols/equiv.gif 0 mod 2P+1. This will happen when 3R-1 is divisible by 2P, but no larger power. But the order of 3 mod 23 is 2, and this implies that, for P http://www.ocf.berkeley.edu/~wwu/YaBBImages/symbols/ge.gif 3, the order of 3 mod 2P is 2P-2. We therefore take Q' = Q + 2P-2.[/hideb] |
||
Title: Re: Add To Power And Divide, Get Integer? Post by Eigenray on Aug 6th, 2007, 9:02am Another solution: [hideb]Z2^P* = Z2^(P-2) x Z2, where the first factor is generated by 5 = (1,0), and the second factor is generated by -1 = (0,1). Let P http://www.ocf.berkeley.edu/~wwu/YaBBImages/symbols/ge.gif 3, and let 3 = (a,b). Now, 3 is not a power of 5 mod 4, so b=1. And a can't be even, otherwise we'd have 3 = -5a = 7 mod 8. So 3 = (a,1), where a is odd. So there is some Q such that Q*a = 1 mod 2P-2, so 3Q = (1,1) = -5.[/hideb] |
||
Powered by YaBB 1 Gold - SP 1.4! Forum software copyright © 2000-2004 Yet another Bulletin Board |