Definition 28.1.1 · Palindrome
A palindrome is a number that reads the same forward and backward, such as , or .
Palindromes, coin problems and a grab bag of number-theory tricks: pair numbers up, find the largest total two coins can't make, and spot patterns in digits and grids.
In this section you will be able to build palindromes digit by digit, and use their place values to find means and divisibility.
Pair with , then with , then with . Every pair adds to , so each pair averages . That is the mean of all three-digit palindromes, with no big sum needed.
A palindrome is fixed by its first half. The second half just copies it in mirror order. So a three-digit palindrome has choices.
Look: write a palindrome in place values. and . Since and , every four-digit palindrome is a multiple of .
A palindrome is a number that reads the same forward and backward, such as , or .
Find the arithmetic mean of all the three-digit palindromes. (Recall that a palindrome is a number that reads the same forward and backward, such as or .)
A three-digit palindrome looks like . You choose (not ) and . How many three-digit palindromes are there?
Driving along a highway, Megan noticed that her odometer showed (miles). This number is a palindrome: it reads the same forward and backward. Then hours later, the odometer displayed the next higher palindrome. What was her average speed, in miles per hour, during this -hour period?
A palindrome, such as , is a number that remains the same when its digits are reversed. The numbers and are three-digit and four-digit palindromes, respectively. What is the sum of the digits of ?
How many -digit palindromes (numbers that read the same backward as forward) can be formed using the digits ?
A palindrome between and is chosen at random. What is the probability that it is divisible by ?
A palindrome is a nonnegative integer number that reads the same forwards and backwards when written in base with no leading zeros. A -digit palindrome is chosen uniformly at random. What is the probability that is also a palindrome?
In this section you will be able to find the largest total two coin sizes can't make, and count the totals they miss.
You only have -cent and -cent coins. You can pay , and cents. Then you can pay everything after that: just add another . So is the largest amount you can never pay.
With two coin sizes and that share no factor, the largest amount you can’t make is . Once you can make amounts in a row, adding again and again reaches every larger amount.
Look: if and share a factor, like and , every total is even. Then infinitely many amounts are missed, and the theorem does not apply.
The last example in this section is a different kind of number puzzle: spot a digit pattern in small cases first.
If and are relatively prime positive integers, the largest number that cannot be written as a sum of non-negative multiples of and is
Moreover, exactly
positive integers cannot be written in the form with and non-negative integers.
Why every works. The numbers have different remainders mod (because ). So one of them, with , is a multiple of . It is at least , so it is with .
Why fails. If , then . So and , which forces . Impossible.
The count. is reachable exactly when is not. So the numbers split into reachable/unreachable pairs, and exactly half of these numbers are unreachable.
This theorem is useful for problems like "the largest amount of money that can't be made with -cent and -cent coins".
The town of Hamlet has people for each horse, sheep for each cow, and ducks for each person. Which of the following could not possibly be the total number of people, horses, sheep, cows, and ducks in Hamlet?
Say there are horses and cows. Then there are people. How many ducks are there for each horse?
The product , where the second factor has digits, is an integer whose digits have a sum of . What is ?
Try small cases first.
| product | digit sum | |
|---|---|---|
What is ?
Ninety-four bricks, each measuring , are to be stacked one on top of another to form a tower bricks tall. Each brick can be oriented so it contributes or or to the total height of the tower. How many different tower heights can be achieved using all ninety-four of the bricks?
Find the sum of all positive integers such that, given an unlimited supply of stamps of denominations , , and cents, cents is the greatest postage that cannot be formed.
In this section you will be able to mix palindromes, coin problems, games and digit patterns on contest problems.
These problems don’t share one big idea. They share a habit: try small cases, find the pattern, then prove it.
Write out the first few rows, piles or squares before you compute anything big. Spirals, games and floor sums all repeat in a way you can see after a few steps.
Suppose
What is the value of ?
Mr. Zhou places all the integers from to into a by grid. He places in the middle square (eighth row and eighth column) and places other numbers one by one clockwise, as shown in part in the diagram below. What is the sum of the greatest number and the least number that appear in the second row from the top?
A set of numbers is called sum-free if whenever and are (not necessarily distinct) elements of the set, is not an element of the set. For example, and the empty set are sum-free, but is not. What is the greatest possible number of elements in a sum-free subset of ?
Let denote the number of positive integers that divide , including and . For example, , , and . (This function is known as the divisor function.) Let
There is a unique positive integer such that for all positive integers . What is the sum of the digits of ?
Alice and Bob are playing a game with coins in a pile. Every turn, a player can take or coins from the pile, and Alice goes first. The player that takes the last coin wins. How many values of less than or equal to are there such that no matter what Alice does, Bob has a winning strategy?
What is the ones digit of the sum
(Recall that represents the greatest integer less than or equal to .)
This problem also appears in the book as 21.3.18.
Joey and Chloe and their daughter Zoe all have the same birthday. Joey is year older than Chloe, and Zoe is exactly year old today. Today is the first of the birthdays on which Chloe's age will be an integral multiple of Zoe's age. What will be the sum of the two digits of Joey's age the next time his age is a multiple of Zoe's age?
Let be the positive integer , a -digit number where each digit is a . Let be the leading digit of the th root of . What is
An array of numbers is constructed beginning with the numbers in the top row. Each adjacent pair of numbers is summed to produce a number in the next row. Each row begins and ends with and , respectively.
If the process continues, one of the rows will sum to . In that row, what is the third number from the left?