2019 AMC 10A Problems/Problem 23
Travis has to babysit the terrible Thompson triplets. Knowing that they love big numbers, Travis devises a counting game for them. First Tadd will say the number , then Todd must say the next two numbers ( and ), then Tucker must say the next three numbers (, , ), then Tadd must say the next four numbers (, , , ), and the process continues to rotate through the three children in order, each saying one more number than the previous child did, until the number is reached. What is the th number said by Tadd?
Define a round as one complete rotation through each of the three children, and define a turn as the portion when one child says his numbers (similar to how a game is played).
We create a table to keep track of what numbers each child says for each round.
Tadd says number in round 1, numbers in round 2, numbers in round 3, and in general numbers in round n. At the end of round n, the number of numbers Tadd has said so far is , by the sum of arithmetic series formula.
We find that , so Tadd says his 2035th number at the end of his turn in round 37. That also means that Tadd says his 2019th number in round 37. At the end of Tadd's turn in round 37, the children have, in total, completed turns. In general, at the end of turn , the nth triangular number is said, or . So at the end of turn 109 (or the end of Tadd's turn in round 37), Tadd says the number . Recalling that this was the 2035th number said by Tadd, so the 2019th number he said was .
Thus, the answer is .
Firstly, as in Solution 1, we list how many numbers Tadd says, Todd says, and Tucker says in each round.
We can find a general formula for the number of numbers each of the kids say after the th round. For Tadd, we can either use the arithmetic series sum formula (like in Solution 1) or standard summation results to get .
Now, to find the number of rotations Tadd and his siblings go through before Tadd says his th number, we know the inequality must be satisfied, and testing numbers gives the maximum integer value of as .
The next main insight, in order to simplify the computation process, is to notice that the th number Tadd says is simply the number of numbers Todd and Tucker say plus the Tadd says, which will be the answer since Tadd goes first.
Carrying out the calculation thus becomes quite simple:
At this point, we can note that the last digit of the answer is , which gives . (Completing the calculation will confirm the answer, if you have time.)
Think of a turn as adding a block or an interval of numbers to each person. Here are the first couple "blocks" that Tadd has (a block will be denoted in interval notation): , [-], [-], [-]. From simple inspection, we can notice two things.
) The start points of each interval is increasing arithmetically by .
) The length of each "block" is increasing by .
Since each block length is increasing by 3, then we want +++.. = or , where is the amount of blocks we have. In a short amount of time, you will see that is not an integer from that equation, but thats perfectly okay since we can just find an that gets it close to 2019, then we can work from there. From inspection, you will see that a good n value that does that exact job is .
We can then deduce that the start point of the th block will be if we refer to fact . We can easily find the length of 37th block by if we refer to fact . Remember that the length increases by for each block. So we then can deduce that our endpoint for the 37th block is . The endpoint of the th block will be the th number said because we can plug into , which tells us how many numbers Tadd has said where is the number of blocks Tadd has. From there we know that the th number is in th block, so that means we can take our endpoint and subtract from the endpoint of the th block, which is , so we get or . ~~triggod
The statement that says that the max number is 10000 is pretty much useless. You can just ignore it.
Video Solution 1 By Richard Rusczyk
Video Solution 2 by TheBeautyofMath
|2019 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|