Some problems are too big to attack head on. Nobody multiplies out the five hundredth term of anything. Instead you compute a few small cases, line the results up, and look for a pattern that repeats. Once you know how it repeats, one short division carries you to the five hundredth case.
Show a hint
- The ones digits run \(8, 6, 4, 2, 0\) and then start over, a loop of length \(5\).
- Divide \(43\) by \(5\) and let the remainder point to a spot inside the loop.
Show the full solution
The ones digits run \(8, 6, 4, 2, 0\) and then start over, a loop of length \(5\). Since \(43 = 8 \times 5 + 3\), the \(43\)rd multiple sits at the third spot of a fresh loop, so it ends in \(\boxed{4}\).
Checking directly, \(43 \times 8 = 344\).
Show a hint
- Each full run of \(9\) tiles contains exactly one star, so first count complete runs inside \(500\).
- Since \(500 = 55 \times 9 + 5\), there are \(55\) full runs plus \(5\) leftover tiles. Check whether any of those leftovers is a star.
Show the full solution
Dividing, \(500 = 55 \times 9 + 5\), so the hallway holds \(55\) complete runs and then \(5\) extra tiles.
Each complete run contributes one star, giving \(55\) so far. The five leftover tiles are the first five of a new run, all hexagons, so none of them is a star.
$$55 + 0 = \boxed{55}$$
Show a hint
- The powers begin \(3, 9, 27, 81, 243\). Read off just the ones digits.
Show the full solution
The ones digits run \(3, 9, 7, 1\), and then \(3^5 = 243\) brings the digit back to \(3\), and the loop restarts.
The loop is \(3, 9, 7, 1\), which is \(\boxed{4}\) steps long.
Show a hint
- The loop \(3, 9, 7, 1\) restarts every \(4\) powers, so divide \(43\) by \(4\).
- A remainder of \(3\) lands on the third digit of the loop.
Show the full solution
Since \(43 = 10 \times 4 + 3\), the exponent \(43\) lands three steps into a fresh loop of \(3, 9, 7, 1\), and the third digit of that loop is \(\boxed{7}\).
The exponent could be in the millions and the work would not change, one division by the loop length.
Show a hint
- Compute ones digits of \(7^1, 7^2, 7^3, 7^4\). Multiplying ones digits only, \(7, 9, 3, 1\), then the loop restarts.
- With a loop of length \(4\), the exponent \(7\) leaves remainder \(3\), the third spot.
Show the full solution
Tracking only ones digits, \(7 \times 7\) ends in \(9\), then \(9 \times 7\) ends in \(3\), then \(3 \times 7\) ends in \(1\), and the loop \(7, 9, 3, 1\) restarts.
Since \(7 = 1 \times 4 + 3\), the seventh power lands on the loop's third digit.
$$7^7 \text{ ends in } \boxed{3}$$
Indeed \(7^7 = 823{,}543\).
Show a hint
- Make a tiny table. Terrace \(1\) has \(14\), terrace \(2\) has \(17\), terrace \(3\) has \(20\). Each step down adds one \(3\).
- Reaching terrace \(20\) takes \(19\) steps down from the top.
Show the full solution
Each terrace adds \(3\), and getting from terrace \(1\) to terrace \(20\) takes \(19\) such steps.
$$14 + 19 \times 3 = 14 + 57 = \boxed{71}$$
In general the \(n\)th terrace holds the starting \(14\) plus \(n - 1\) copies of the step.
Show a hint
- Pair the terraces from the outside in. The first with the last gives \(14 + 71 = 85\), the second with the second to last gives \(17 + 68 = 85\) again.
- Twenty terraces form \(10\) such pairs.
Show the full solution
Pair the top terrace with the bottom one, the second with the second from the bottom, and so on. Every pair totals the same amount,
$$14 + 71 = 17 + 68 = \cdots = 85$$
because each step inward adds \(3\) to one partner and removes \(3\) from the other. Ten pairs at \(85\) apiece give
$$10 \times 85 = \boxed{850}$$
Show a hint
- Keep pressing. The list runs \(3, 8, 4, 2, 1, 6\) and then returns to \(3\), so it loops every \(6\) numbers.
- Since \(100 = 16 \times 6 + 4\), the \(100\)th number sits at the fourth spot of the loop.
Show the full solution
Following the rule, \(3 \to 8 \to 4 \to 2 \to 1 \to 6 \to 3\), and the display is trapped in a loop of six numbers, \(3, 8, 4, 2, 1, 6\).
With \(100 = 16 \times 6 + 4\), the \(100\)th number is the fourth member of the loop.
$$\boxed{2}$$
Iteration problems almost always fall into a loop, because a rule with limited outputs must eventually revisit a number, and from there history repeats exactly.
Show a hint
- The running totals are \(1, 4, 9, 16, \ldots\), which are perfect squares.
- After \(n\) bursts the total is \(n^2\), so evaluate \(20^2\).
Show the full solution
The running totals are \(1, 4, 9, 16\), the perfect squares, so \(n\) bursts should total \(n^2\) beats. A fifth case agrees, \(16 + 9 = 25\).
$$20^2 = \boxed{400}$$
Each new odd burst adds one more L-shaped shell to a square of dots, which grows it to the next square. The next insight draws it.
Show a hint
- The joint flashes are themselves a repeating pattern. They happen at times that are multiples of both \(6\) and \(10\), and the first is at the least common multiple.
- Shared flashes come every \(30\) seconds, and \(3\) minutes holds \(180\) seconds.
Show the full solution
A shared flash needs a time that is a multiple of \(6\) and of \(10\) at once, and the smallest is \(\text{lcm}(6,10) = 30\). So the signs align every \(30\) seconds, at \(30, 60, 90, 120, 150,\) and \(180\) seconds.
$$180 \div 30 = \boxed{6}$$
Two separate rhythms always merge into one bigger rhythm, and its length is their least common multiple, which you met back in the divisibility chapter.
Practice these ideas
Show the solution
Since \(75 = 9 \times 8 + 3\), nine full passes finish and the \(75\)th play is the third song of the next pass, song \(\boxed{3}\).
Show the solution
There are \(33\) complete bands, each with \(5\) blue rows, for \(165\). The \(4\) leftover rows are the start of a new band, and the first \(5\) rows of any band are blue, so all \(4\) leftovers are blue.
$$165 + 4 = \boxed{169}$$
Show the solution
Odd powers of \(9\) end in \(9\) and even powers end in \(1\). Since \(55\) is odd, \(9^{55}\) ends in \(\boxed{9}\).
Show the solution
The ones digit alternates, \(4\) for odd exponents and \(6\) for even ones. The exponent \(100\) is even, so the digit is \(\boxed{6}\).
Show the solution
Fourteen steps of \(4\) sit between the first and fifteenth strands,
$$7 + 14 \times 4 = 7 + 56 = \boxed{63}$$
Show the solution
The bottom row holds \(5 + 29 \times 2 = 63\) bricks. Pairing the top row with the bottom, the second with the second from the bottom, and so on gives \(15\) pairs, each totaling \(68\).
$$15 \times 68 = \boxed{1020}$$
Show the solution
The screen cycles through \(6, 12, 24, 9, 18, 36, 21\) and then repeats, a loop of length \(7\).
Since \(50 = 7 \times 7 + 1\), the \(50\)th number is the first member of the loop, \(\boxed{6}\).
Show the solution
The running totals of odd numbers are the perfect squares, so the student stopped when \(n^2 = 225\), that is \(n = \boxed{15}\).
Show the solution
The meeting point must be a multiple of both \(8\) and \(14\), and \(\text{lcm}(8, 14) = 56\) teeth. The small gear completes
$$56 \div 8 = \boxed{7}$$
full turns. The big gear makes \(4\), and the two marks line up again.
Show the solution
Both loops have length \(4\), and \(43\) leaves remainder \(3\), landing on the third spot of each. So \(3^{43}\) ends in \(7\) and \(7^{43}\) ends in \(3\).
Then \(7 + 3 = 10\), so the sum ends in \(\boxed{0}\).
QuanticaPrealgebraOpen in the course