Search problems

15 problems match “prime factorisation”. Clear

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

  1. Divisors giving equal quotient and remainder ●●●○○ 50 ptsWhen 2014 is divided by 105, the quotient is 19 and the remainder is also 19. Find all natural numbers NN other than 105 such that dividing 2014 by NN gives a quotient equal to the remainder. List the values in increasing order.
  2. Terminating decimals with nonzero hundredths digit ●●●○○ 50 ptsFor how many positive integers nn does 1n\frac{1}{n} yield a terminating decimal with a non-zero hundredths digit?
  3. 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.
  4. Minimal f(2007) for a functional equation ●●●●○ 100 ptsLet ff be a function taking the positive integers to the positive integers, such that f(mf(n))=nf(m)f(mf(n)) = nf(m) for all positive integers mm and nn. Find the smallest possible value of f(2007)f(2007).
  5. 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?

← Previous