Number Properties
Perfect squares/cubes, parity, consecutive integers, floor/ceiling, integer sequences
What you need to know
- Parity (odd and even). Odd odd even, and odd odd odd. A sum of integers is odd exactly when it has an odd number of odd terms. A number and its square are both odd or both even: . Example: has three odd terms, so it is odd ().
- Perfect squares end in , , , , , or , never , , , or . Divided by , a square leaves remainder or ; divided by , also or . An odd square leaves remainder when divided by . Example: ends in , so it is not a square; .
- Perfect cubes leave remainder , , or when divided by . Since , we write this as . Example: and .
- Consecutive integers. Among any consecutive integers, exactly one is divisible by . Even more: the product of any consecutive integers is divisible by . Why: for positive integers, the product divided by is a binomial coefficient, which counts something, so it is a whole number. Example: , and .
- Floor function. (the floor of ) is the greatest integer less than or equal to : round down. So . Example: and .
- Counting squares. There are perfect squares from to . Example: , since and .
- . If is odd, this is divisible by . If does not divide , it is divisible by . Example: .
- Two sums. , and the first odd numbers add to . Example: and .
How AMC 10 tests it
- "How many integers in a range make (or ) divisible by ?" Parity and remainders (problems 10–16).
- Counting squares or cubes in a range, or numbers that are neither: floors of square and cube roots plus the Principle of Inclusion-Exclusion (PIE).
- Parity arguments: a sum of odd numbers can't be ; chessboard-coloring arguments that something is impossible.
- Sequences of integers with a growth rule: find how many terms are below , or a particular term, using floors.
- "Which of the following must be true about ?" with five statements about odd and even, squares, and products of consecutive numbers.
Standard approaches
- Check parity first; it rules out half the possibilities in seconds.
- Factor the expression, then check what divides each factor. Example: is always even, since one of two consecutive integers is even.
- Work mod , , , or , where squares and cubes have few possible remainders.
- To count from to , use floors and PIE, and double-check the endpoints.
- When a statement "must" hold, test , , and a prime. One counterexample settles it.
Worked example
For how many integers with is divisible by ?
(A) (B) (C) (D) (E)
Step 1: split . and . Since and share no factor, check each one separately.
Step 2: the . If is odd, and are two even numbers in a row, like and . One is a multiple of and the other a multiple of , so their product is a multiple of . If is even, the product is odd.
Step 3: the . Exactly one of , , is a multiple of . If does not divide , it divides or . If divides , it divides neither.
Step 4: the condition. So divides exactly when is odd and not a multiple of , that is, when .
Step 5: count with PIE. From to there are even numbers, multiples of , and multiples of (counted twice). That leaves .
The answer is .
Pitfalls
- Believing every square leaves remainder when divided by . Only odd squares do. Example: leaves .
- Miscounting squares from to . The count is , where (the ceiling) means round up. Using leaves out when is a perfect square. Example: from to there are squares (): , not .
- Assuming ; it can be off by one. Example: , but .
- Forgetting that and are integers that may satisfy (or break) the condition. Example: in the worked example counts, since and divides .
Traps that recur
- Counting one solution for every integer n with |x| < 100 (n = -100 to 99, giving 200) without noticing that n = 99 yields only f = 1, which is excluded. (2018 AMC 10B #25)
- Counting the 45 pairs (j, k) with 1 <= j < k <= 10 as separate jump points, forgetting that equal fractions like 1/2 = 2/4 = 3/6 are one jump. (2016 AMC 10B #25)
- Forgetting the constraint r <= 2m (so that m^2 is really the largest square below n) and choosing a smaller m, or miscounting: 8 numbers in the sequence means 7 subtractions. (2010 AMC 10A #25)
- Using the naive pattern 1, 4, 7, 10, … (odds only 6 apart) or evens spaced 4 apart (506), or dropping the extra 2 elements from the leftover 2021–2024. (2024 AMC 10A #20)
- 1.2024 AMC 10A #4
The number is written as the sum of not necessarily distinct two-digit numbers. What is the least number of two-digit numbers needed to write this sum?
- A)
- B)
- C)
- D)
- E)
- 2.2023 AMC 10A #3
How many positive perfect squares less than are divisible by ?
- A)
- B)
- C)
- D)
- E)
- 3.2016 AMC 10A #4
The remainder can be defined for all real numbers and with by where denotes the greatest integer less than or equal to . What is the value of ?
- A)
- B)
- C)
- D)
- E)
- 4.2016 AMC 10A #5
A rectangular box has integer side lengths in the ratio . Which of the following could be the volume of the box?
- A)
- B)
- C)
- D)
- E)
- 5.2013 AMC 10B #4
When counting from to , is the number counted. When counting backwards from to , is the number counted. What is ?
- A)
- B)
- C)
- D)
- E)
- 6.2011 AMC 10A #2
A small bottle of shampoo can hold 35 milliliters of shampoo, whereas a large bottle can hold 500 milliliters of shampoo. Jasmine wants to buy the minimum number of small bottles necessary to completely fill a large bottle. How many bottles must she buy?
- A)
- B)
- C)
- D)
- E)
- 7.2009 AMC 10A #2
Four coins are picked out of a piggy bank that contains a collection of pennies, nickels, dimes and quarters. Which of the following could not be the total value of the four coins, in cents?
- A)
- B)
- C)
- D)
- E)
- 8.2023 AMC 10B #9
The numbers and are a pair of consecutive positive squares whose difference is . How many pairs of consecutive positive perfect squares have a difference of less than or equal to ?
- A)
- B)
- C)
- D)
- E)
- 9.2020 AMC 10B #7
How many positive even multiples of less than are perfect squares?
- A)
- B)
- C)
- D)
- E)
- 10.2019 AMC 10A #5
What is the greatest number of consecutive integers whose sum is
- A)
- B)
- C)
- D)
- E)
- 11.2014 AMC 10A #8
Which of the following numbers is a perfect square?
- A)
- B)
- C)
- D)
- E)
- 12.2012 AMC 10B #9
Two integers have a sum of 26. When two more integers are added to the first two integers the sum is 41. Finally when two more integers are added to the sum of the previous four integers the sum is 57. What is the minimum number of odd integers among the 6 integers?
- A)
- B)
- C)
- D)
- E)
- 13.2006 AMC 10A #10
For how many real values of is an integer?
- A)
- B)
- C)
- D)
- E)
- 14.2006 AMC 10A #9
How many sets of two or more consecutive positive integers have a sum of ?
- A)
- B)
- C)
- D)
- E)
- 15.2004 AMC 10B #6
Which of the following numbers is a perfect square?
- A)
- B)
- C)
- D)
- E)
- 16.2003 AMC 10B #7
The symbolism denotes the largest integer not exceeding . For example, and . Compute
- A)
- B)
- C)
- D)
- E)
- 17.2025 AMC 10A #21
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 ?
- A)
- B)
- C)
- D)
- E)
- 18.2023 AMC 10B #15
What is the least positive integer such that is a perfect square?
- A)
- B)
- C)
- D)
- E)
- 19.2022 AMC 10B #14
Suppose that is a subset of such that the sum of any two (not necessarily distinct) elements of is never an element of What is the maximum number of elements may contain?
- A)
- B)
- C)
- D)
- E)
- 20.2020 AMC 10A #18
Let be an ordered quadruple of not necessarily distinct integers, each one of them in the set For how many such quadruples is it true that is odd? (For example, is one such quadruple, because is odd.)
- A)
- B)
- C)
- D)
- E)
- 21.2007 AMC 10A #17
Suppose that and are positive integers such that . What is the minimum possible value of ?
- A)
- B)
- C)
- D)
- E)
- 22.2024 AMC 10A #20
Let be a subset of such that the following two conditions hold:
- If and are distinct elements of , then
- If and are distinct odd elements of , then
What is the maximum possible number of elements in ?
- A)
- B)
- C)
- D)
- E)
- 23.2023 AMC 10B #22
How many distinct values of satisfy where denotes the largest integer less than or equal to ?
- A)
- B)
- C)
- D)
- E)
- 24.2020 AMC 10A #22
For how many positive integers is not divisible by ? (Recall that is the greatest integer less than or equal to .)
- A)
- B)
- C)
- D)
- E)
- 25.2020 AMC 10B #24
How many positive integers satisfy (Recall that is the greatest integer not exceeding .)
- A)
- B)
- C)
- D)
- E)
- 26.2015 AMC 10B #21
Cozy the Cat and Dash the Dog are going up a staircase with a certain number of steps. However, instead of walking up the steps one at a time, both Cozy and Dash jump. Cozy goes two steps up with each jump (though if necessary, he will just jump the last step). Dash goes five steps up with each jump (though if necessary, he will just jump the last steps if there are fewer than 5 steps left). Suppose Dash takes 19 fewer jumps than Cozy to reach the top of the staircase. Let denote the sum of all possible numbers of steps this staircase can have. What is the sum of the digits of ?
- A)
- B)
- C)
- D)
- E)
- 27.2011 AMC 10A #19
In 1991 the population of a town was a perfect square. Ten years later, after an increase of 150 people, the population was 9 more than a perfect square. Now, in 2011, with an increase of another 150 people, the population is once again a perfect square. Which of the following is closest to the percent growth of the town's population during this twenty-year period?
- A)
- B)
- C)
- D)
- E)
- 28.2011 AMC 10B #21
Brian writes down four integers whose sum is . The pairwise positive differences of these numbers are and . What is the sum of the possible values for ?
- A)
- B)
- C)
- D)
- E)
- 29.2002 AMC 10A #22
A set of tiles numbered 1 through 100 is modified repeatedly by the following operation: remove all tiles numbered with a perfect square, and renumber the remaining tiles consecutively starting with 1. How many times must the operation be performed to reduce the number of tiles in the set to one?
- A)
- B)
- C)
- D)
- E)
- 30.2018 AMC 10B #25
Let denote the greatest integer less than or equal to . How many real numbers satisfy the equation ?
- A)
- B)
- C)
- D)
- E)
- 31.2016 AMC 10B #25
Let , where denotes the greatest integer less than or equal to . How many distinct values does assume for ?
- A)
- B)
- C)
- D)
- E)
- 32.2010 AMC 10A #25
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 ?
- A)
- B)
- C)
- D)
- E)
Answers
| # | Answer | The idea it turns on |
|---|---|---|
| 1 | B | The biggest two-digit number is 99. Twenty of them make only 1980, which is short of 2024, but twenty 99s plus a 44 make exactly 2024. |
| 2 | A | A square is a multiple of 5 only when the number squared is a multiple of 5. Count 5, 10, 15, and so on while the square stays below 2023. |
| 3 | B | The division 3/8 divided by -2/5 is -15/16, a bit above -1. Rounding down gives -1, not 0, so the answer is 3/8 - 2/5 = -1/40. |
| 4 | D | Call the sides k, 3k and 4k. The volume is 12 times k cubed, so it must be 12 times a perfect cube. Only 96 = 12 times 8 works. |
| 5 | D | Counting down from 201 to 53 counts both end numbers, so the count is 201 minus 53, plus 1. |
| 6 | E | Fourteen small bottles hold only 490 milliliters, which is not quite 500, so she needs one more bottle. |
| 7 | A | Every choice is a multiple of 5, so the pennies must total a multiple of 5, which means none; four coins of at least 5 cents make at least 20. |
| 8 | B | Neighboring squares n squared and (n+1) squared always differ by 2n + 1. So count the values of n that make 2n + 1 at most 2023. |
| 9 | A | A square that is a multiple of 6 must be the square of a multiple of 6, so list 6 squared, 12 squared, and so on below 2020. |
| 10 | D | The integers may be negative. A run from -44 up to 44 adds to 0, so adding 45 on the end gives sum 45 with 90 numbers in the run. |
| 11 | D | The two factorials share a big common part, so each choice is a perfect square times (n+1)/2. Only 18/2 = 9 is a perfect square. |
| 12 | A | Split the totals into three pairs that add to 26, 15 and 16. Only the pair adding to 15, an odd number, is forced to contain an odd integer. |
| 13 | E | Call the integer k. Then the square root of x equals 120 − k^2, which cannot be negative, so k can be 0, 1, 2, up to 10: eleven values. |
| 14 | C | Sum = (how many numbers) times (their average). Try runs of 2, 3, 4, 5, 6 numbers and see which give 15 using only positive numbers. |
| 15 | C | Write the bigger factorial as the smaller one times the extra numbers. For example 100! is 100 times 99!, so 99! times 100! is (99!) squared times 100, a square. |
| 16 | B | The rounded-down square root stays the same between perfect squares: it is 1 three times, 2 five times, 3 seven times, then 4 once at 16. |
| 17 | C | Look at the largest number in the set. Pair up the smaller numbers so each pair adds to it; the set can hold at most one number from each pair. |
| 18 | C | Pair each factorial with the next, like 3! times 4! = (3!) squared times 4. What remains is a square times 8!, and 8! needs 2 times 5 times 7. |
| 19 | B | The numbers 13 to 25 work, since every sum is at least 26. Pairing smaller numbers that add to the largest number shows 14 is impossible. |
| 20 | C | The difference is odd when exactly one of the two products is odd. A product of two numbers from 0 to 3 is odd for only 4 of 16 pairs. |
| 21 | D | 75 is 3 times 5 times 5. To make a perfect cube, m must add two more 3s and one more 5, so m = 45 and n = 15. |
| 22 | C | Ten numbers in a row hold at most 3 members; four would force two odd members 6 apart. The pattern 1, 4, 8 in each ten reaches 608. |
| 23 | B | Call the floor k. Then x = (k squared + 2)/3, and this x must really have floor k. Only k = 0, 1, 2, 3 pass that test. |
| 24 | A | The three floors are equal, so their sum is a multiple of 3, unless n divides 999 or 1000. Count those divisors, leaving out n = 1. |
| 25 | C | Call the common value k. Then n = 70k - 1000, and n must be at least k squared but less than (k+1) squared. Solve both conditions. |
| 26 | D | Jump counts are steps divided by 2 or 5, rounded up. Their difference stays close to 3/10 of the steps, so only 62 to 66 need checking. |
| 27 | E | Call 1991 a² and 2001 b² + 9. Then b² − a² = 141, so a = 70 or a = 22. Only 22 also makes 2011 a perfect square. |
| 28 | B | The biggest difference, 9, is w minus z. It is made of three gaps between neighbors, which must be 1, 3 and 5, with 1 in the middle. |
| 29 | C | Starting from a square number of tiles, two rounds always bring you to the next smaller square: 100, 90, 81, then 72, 64, and so on. |
| 30 | C | Split x into whole part n and decimal part. Each interval from n to n + 1 has one solution when (n + 1) squared is below 10,000. |
| 31 | A | Each term depends only on the part of x after the decimal point. As it grows, f steps up once at each fraction with bottom at most 10. |
| 32 | B | Work backwards. If m squared is the largest square below n, the leftover is at most 2m, so each smallest start is the previous one plus the smallest allowed square. |
Problems © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. The topic note, tags and key insights are original to this site.