Search problems

20 problems match “divisibility”. Clear

Visitors search a sample. Sign in for free to search every problem. Sign in

  1. Smallest result from changing multiplications to divisions ●●●○○ 50 ptsIn the expression 9×8×7×6×5×4×3×2×19 \times 8 \times 7 \times 6 \times 5 \times 4 \times 3 \times 2 \times 1, some of the "×\times" signs are changed to "÷\div" so that the final result is still a natural number NN. Find the smallest possible NN.
  2. Maximum size of a set with integer means ●●●○○ 50 ptsLet SS be a set of positive integers with the property that for any x∈Sx \in S, the arithmetic mean of the remaining numbers in SS after removing xx is a positive integer. Suppose 1∈S1 \in S and 20162016 is the largest element of SS. Find the maximum value of ∣S∣|S|.
  3. Sum of four progression terms ●●●○○ 50 ptsIn an increasing sequence of four positive integers, the first three terms form an arithmetic progression, the last three terms form a geometric progression, and the first and fourth terms differ by 3030. Find the sum of the four terms.
  4. Removable sine factors keeping natural roots ●●●○○ 50 ptsThe left-hand side of the equation sin⁡πxsin⁡2πxsin⁡3πx⋯sin⁡2015πx=0\sin \frac{\pi}{x} \sin \frac{2\pi}{x} \sin \frac{3\pi}{x} \cdots \sin \frac{2015\pi}{x}=0 is a product of factors sin⁡nπx\sin \frac{n\pi}{x} for n=1,2,…,2015n=1,2,\ldots,2015. What is the maximum number of these factors that can be crossed out so that the number of natural-number roots of the equation does not change?
  5. Maximum elephants with a unique distribution ●●●○○ 50 ptsOstap Bender organized an elephant giveaway in the city of Fux. 28 union members and 37 non-members showed up, and Ostap distributed the elephants so that all union members received the same number of elephants and all non-members received the same number of elephants (the two numbers may differ). It turned out that there was only one way to distribute the elephants so that all of them were given away. What is the maximum number of elephants Ostap Bender could have had? (Each person who came received at least one elephant.)
  6. Coin flips moving two numbers together ●●●○○ 50 ptsSteph and Jeff each start with the number 4, and Travis is flipping a coin. Every time he flips heads, Steph replaces her number xx with 2x−12x-1, and Jeff replaces his number yy with y+8y+8. Every time he flips tails, Steph replaces her number xx with x+12\frac{x+1}{2}, and Jeff replaces his number yy with y−3y-3. After some (positive) number of coin flips, Steph and Jeff end up with the same number, which is below 2012. How many times was the coin flipped?
  7. Product preserved after altering two numbers ●●●○○ 50 ptsLucas writes two distinct positive integers on a whiteboard. He decreases the smaller number by 20 and increases the larger number by 23, and finds that the product of the two original numbers equals the product of the two altered numbers. Compute the minimum possible sum of the original two numbers.
  8. Exactly two friends visiting Daphne ●●●○○ 50 ptsDaphne is visited periodically by her three best friends, Alice, Beatrix and Claire. Alice visits every third day, Beatrix every fourth day, and Claire every fifth day. All three friends visited Daphne yesterday. On how many days of the next 365-day period will exactly two friends visit her?
  9. Minimum respondents on the twelfth day ●●●○○ 50 ptsDuring the first eleven days, 700 people responded to a survey question. Each person chose exactly one of three options, and the ratio of the numbers of responses was 4:7:144:7:14. On the twelfth day, several more people responded, so that the number of responses for each option did not decrease and the ratio became 6:9:166:9:16. What is the minimum number of people who must have responded on the twelfth day?
  10. Least integer with percentage conditions ●●●○○ 50 ptsLet NN be the least positive integer that is both 22 percent less than one integer and 16 percent greater than another integer. Find the remainder when NN is divided by 1000.

← Previous