Assorted divisibility puzzles
Solve the first problem 15 problems
These are 10 of the 15 problems. Sign in for free to see them all. Sign in
- Odd reciprocals with terminating decimals ●●○○○ 20 ptsIf is the probability that the reciprocal of a randomly selected positive odd integer less than gives a terminating decimal, with and relatively prime positive integers, find .
- Positive integers giving a hole ●●○○○ 20 ptsFind the number of positive integers for which the graph of has a hole at .
- Smallest multiple beyond 2010 with terminating decimals ●●○○○ 20 ptsLet be the set of all integers such that and are both terminating decimals. What is the smallest integer in that is greater than 2010?
- Minimum distinct values in a ratio chain ●●●○○ 50 ptsLet be positive integers (not necessarily distinct) such that the 2005 ratios are all distinct. What is the least possible number of different values among ?
- Least n with many unit-fraction solutions ●●●○○ 50 ptsLet , and be positive integers, and count the solutions of with . For there are exactly three such solutions. Find the least value of for which the number of solutions exceeds one thousand.
- Natural numbers with terminating quotients ●●●○○ 50 ptsFind all natural numbers such that for every positive integer , the quotient has a finite decimal representation (or is a whole number). List the values in increasing order.
- Integers reaching one in twenty steps ●●●●○ 100 ptsFor every positive integer , let and define a sequence by and for all positive integers . Let be the smallest such that . (For example, and .) Let be the number of positive integers such that . Find the sum of the distinct prime factors of .
- Least number of factors giving 51/2010 ●●●●○ 100 ptsFind the least positive integer for which there exists a set consisting of distinct positive integers such that
- Denominators of partial sums ●●●●○ 100 ptsOlya wrote fractions of the form on cards, where runs over all positive divisors of (including and ). She arranged the cards in some order. She then wrote on the board the number on the first card, the sum of the numbers on the first two cards, the sum of the numbers on the first three cards, and so on, up to the sum of the numbers on all the cards. Each sum was written as an irreducible fraction. What is the smallest possible number of different denominators that could appear on the board?
- Minimum density of a special set ●●●●● 200 ptsLet be a set of positive integers satisfying the following two conditions: (i) for each positive integer , at least one of is in ; (ii) if are positive integers such that and , then . Suppose that has natural density , meaning . Compute the minimum possible value of .
More in Divisibility
Counting multiplesDivisibility by 11Divisibility by 3, 4 and 6Divisibility by 7 and 13Divisibility by 9 and 99Largest divisorsLargest multiple below a boundMissing digits for divisibilityMixed divisibility conditionsMultiples with digit conditions