Difference between revisions of "2010 AMC 10A Problems/Problem 25"
m (→See also)
|Line 48:||Line 48:|
== See also ==
== See also ==
Revision as of 10:25, 25 January 2020
Jim starts with a positive integer and creates a sequence of numbers. Each successive number is obtained by subtracting the largest possible integer square less than or equal to the current number until zero is reached. For example, if Jim starts with , then his sequence contains numbers:
Let be the smallest number for which Jim’s sequence has numbers. What is the units digit of ?
We can find the answer by working backwards. We begin with on the bottom row, then the goes to the right of the equal's sign in the row above. We find the smallest value for which and , which is .
We repeat the same procedure except with for the next row and for the row after that. However, at the fourth row, we see that solving yields , in which case it would be incorrect since is not the greatest perfect square less than or equal to . So we make it a and solve . We continue on using this same method where we increase the perfect square until can be made bigger than it. When we repeat this until we have rows, we get:
Hence the solution is the last digit of , which is .
Note: We can go up to , and then notice the pattern of units digits alternating between and , so we do not need to calculate .
Notice that to get the previous term, we must add the smallest square number, (let's call it ) such that the sum is less than . Otherwise, instead of subtracting from the previous term, we're subtracting a greater square number.
Remember that . Recall that to find the previous term, we must add a square number such that it is less than the next square number. . For this to be true, . What that means is that given a term , we can find the previous term by adding where .
For example, to find the term that precedes , we know that . Therefore, and the previous term is . The last digit of is
|2010 AMC 10A (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25|
|All AMC 10 Problems and Solutions|