I have written a strictly increasing sequence of six positive integers, such that each number (besides the first) is a multiple of the one before it, and the sum of all six numbers is 79 . What is the largest number in my sequence?
Solution
If the fourth number is \geq 12, then the last three numbers must sum to at least . This is impossible, so the fourth number must be less than 12. Then the only way we can have the required divisibilities among the first four numbers is if they are . So the last two numbers now sum to . If we call these numbers then we get , which forces . So the last two numbers are 16,48.
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.