Number theory › Divisibility

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

  1. Odd reciprocals with terminating decimals ●●○○○ 20 ptsIf ab\frac{a}{b} is the probability that the reciprocal of a randomly selected positive odd integer less than 20102010 gives a terminating decimal, with aa and bb relatively prime positive integers, find a+ba+b.
  2. Positive integers giving a hole ●●○○○ 20 ptsFind the number of positive integers nn for which the graph of y=(x+3)(x−7)5(x−1)(x−7)ny = \frac{(x + 3)(x - 7)^5}{(x - 1)(x - 7)^n} has a hole at x=7x = 7.
  3. Smallest multiple beyond 2010 with terminating decimals ●●○○○ 20 ptsLet SS be the set of all integers kk such that 17k66\frac{17k}{66} and 13k105\frac{13k}{105} are both terminating decimals. What is the smallest integer in SS that is greater than 2010?
  4. Minimum distinct values in a ratio chain ●●●○○ 50 ptsLet a1,a2,…,a2006a_{1}, a_{2}, \ldots, a_{2006} be positive integers (not necessarily distinct) such that the 2005 ratios a1a2,a2a3,…,a2005a2006\frac{a_{1}}{a_{2}}, \frac{a_{2}}{a_{3}}, \ldots, \frac{a_{2005}}{a_{2006}} are all distinct. What is the least possible number of different values among a1,a2,…,a2006a_{1}, a_{2}, \ldots, a_{2006}?
  5. Least n with many unit-fraction solutions ●●●○○ 50 ptsLet xx, yy and nn be positive integers, and count the solutions (x,y)(x, y) of 1x+1y=1n\frac{1}{x}+\frac{1}{y}=\frac{1}{n} with x≤yx \le y. For n=4n=4 there are exactly three such solutions. Find the least value of nn for which the number of solutions exceeds one thousand.
  6. Natural numbers with terminating quotients ●●●○○ 50 ptsFind all natural numbers n≥2n \geq 2 such that for every positive integer k<nk < n, the quotient nk\frac{n}{k} has a finite decimal representation (or is a whole number). List the values in increasing order.
  7. Integers reaching one in twenty steps ●●●●○ 100 ptsFor every positive integer xx, let f(x)={1if x=1x10if x is divisible by 10x+1otherwisef(x)=\begin{cases}1 & \text{if }x = 1\\ \frac x{10} & \text{if }x\text{ is divisible by }10\\ x+1 & \text{otherwise}\end{cases} and define a sequence by x1=xx_1=x and xn+1=f(xn)x_{n+1}=f(x_n) for all positive integers nn. Let d(x)d(x) be the smallest nn such that xn=1x_n=1. (For example, d(100)=3d(100)=3 and d(87)=7d(87)=7.) Let mm be the number of positive integers xx such that d(x)=20d(x)=20. Find the sum of the distinct prime factors of mm.
  8. Least number of factors giving 51/2010 ●●●●○ 100 ptsFind the least positive integer nn for which there exists a set {s1,s2,…,sn}\{s_1, s_2, \ldots, s_n\} consisting of nn distinct positive integers such that (1−1s1)(1−1s2)⋯(1−1sn)=512010.\left(1-\frac{1}{s_1}\right)\left(1-\frac{1}{s_2}\right)\cdots\left(1-\frac{1}{s_n}\right)=\frac{51}{2010}.
  9. Denominators of partial sums ●●●●○ 100 ptsOlya wrote fractions of the form 1n\frac{1}{n} on cards, where nn runs over all positive divisors of 61006^{100} (including 11 and 61006^{100}). 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?
  10. Minimum density of a special set ●●●●● 200 ptsLet SS be a set of positive integers satisfying the following two conditions: (i) for each positive integer nn, at least one of n,2n,…,100nn, 2n, \ldots, 100n is in SS; (ii) if a1,a2,b1,b2a_1, a_2, b_1, b_2 are positive integers such that gcd⁡(a1a2,b1b2)=1\gcd(a_1a_2, b_1b_2)=1 and a1b1,a2b2∈Sa_1b_1, a_2b_2 \in S, then a2b1,a1b2∈Sa_2b_1, a_1b_2 \in S. Suppose that SS has natural density rr, meaning lim⁡n→∞1n∣S∩{1,…,n}∣=r\lim_{n\to\infty}\frac{1}{n}|S\cap\{1,\ldots,n\}| = r. Compute the minimum possible value of ⌊105r⌋\lfloor 10^5 r\rfloor.

More in Divisibility