Subcontests
(6)Counting messed up number theory messed up P6
Let n=(q+2)q2021 where q=109+7. For every k<=n and prime p∣n, define
fp,k(n) =vp((kn))
(vp(i) is the highest power of p that divides i).
Let m be the maximum possible (over all k) value of the expression
∏p,prime,p∣nfp,k.
Find the sum of the digits of m. Probability and Expected value, flash back to the AMC
We have 2022 1s written on a board in a line. We randomly choose a strictly increasing sequence from 1,2,...,2022 such that the last term is 2022. If the chosen sequence is a1,a2,...,ak (k is not fixed), then at the ith step, we choose the first ai numbers on the line and change the 1s to 0s and 0s to 1s. After k steps are over, we calculate the sum of the numbers on the board, say S. The expected value of S is ba where a,b are relatively prime positive integers. Find a+b. Valid paths and a whole lot of scary notation
We call a path Valid if
i. It only comprises of the following kind of steps:
A. (x,y)→(x+1,y+1)
B. (x,y)→(x+1,y−1)
ii. It never goes below the x-axis.
Let M(n) = set of all valid paths from (0,0), to (2n,0), where n is a natural number.
Consider a Valid path T∈M(n).
Denote ϕ(T)=∏i=12nμi,
where μi=
a) 1, if the ith step is (x,y)→(x+1,y+1)
b) y, if the ith step is (x,y)→(x+1,y−1)
Now Let f(n)=∑T∈M(n)ϕ(T). Evaluate the number of zeroes at the end in the decimal expansion of f(2021)