Wednesday, 7 August 2019

elementary number theory - What is k so that frac1001times1002times...times200811k will be an integer?



I found this question from last year's maths competition in my country. I've tried any possible way to find it, but it is just way too hard.




  1. What is the largest integer k such that the following equation is an integer?




1001×1002×...×200811k



(A) 100 (B) 101 (C) 102 (D) 103 (E) 105



The first way I did it is calculate the multiple of 11 in 1001 to 2008



(20081001)÷11 (91 multiples of 11) + (20081001)÷121 (8 multiples of 121)+1 (1331 is 113)=100




Are there any mistakes or miscalculations? Are there any more effective ways to find the value of k?


Answer



It is almost correct. The number of multiples of 121 and 1331 are correct. However there are 92 multiples of 11 between 1001 and 2008. To see this, note that 1001 is a multiple of 11 since the alternating sum of the digits is 0.



Now calculate



2008100211=91



This means that there are 91 multiples of 11 between 1002 and 2008. With the number of multiples of 121 and 1331 you were lucky you were correct. For example, for 121 you should have searched for the smallest multiple of 121 bigger than 1001 which is 1089. Now have 20081098121=7




So the answer is 92+8+1=101.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...