p25. You are given that 1000! has 2568 decimal digits. Call a permutation π of length 1000 good if π(2i)>π(2i−1) for all 1≤i≤500 and π(2i)>π(2i+1) for all 1≤i≤499. Let N be the number of good permutations. Estimate D, the number of decimal digits in N.
You will get max(0,25−⌈10∣D−X∣⌉) points, where X is the true answer.
p26. A year is said to be interesting if it is the product of 3, not necessarily distinct, primes (for example 22⋅5 is interesting, but 22⋅3⋅5 is not). How many interesting years are there between 5000 and 10000, inclusive?
For an estimate of E, you will get max(0,25−⌈10∣E−X∣⌉) points, where X is the true answer.
p27. Sam chooses 1000 random lattice points (x,y) with 1≤x,y≤1000 such that all pairs (x,y) are distinct. Let N be the expected size of the maximum collinear set among them. Estimate ⌊100N⌋. Let S be the answer you provide and X be the true value of ⌊100N⌋. You will get max(0,25−⌈10∣S−X∣⌉) points for your estimate.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here. Stanford Math Tournamentnumber theorycombinatorics