Find the largest integer n such that 3512−1 is divisible by 2n.
A number or a short expression. Spacing and $ signs are ignored.
Solution
Write 3512−1=(3256+1)(3256−1)=(3256+1)(3128+1)(3128−1)=⋯=(3256+1)(3128+1)⋯(3+1)(3−1) Now each factor 32k+1,k≥1, is divisible by just one factor of 2 , since 32k+1=(32)2k−1+1≡12k−1+1=2(mod4). Thus we get 8 factors of 2 here, and the remaining terms (3+1)(3−1)=8 give us 3 more factors of 2 , for a total of 11.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.