In triangle ABC, $\angle C=90^\circ$, CA=3 and CB=4. D is on segment AB with CD perpendicular to AB. E is on segment AC with DE perpendicular to CA. If $DE=m^2/n^2$, where m and n are relatively prime, find m+n.
Andrew and Bob play with 2022 face-down cards:1001 black and the rest white. Each round, two cards are drawn consecutively. Black then white means Andrew wins; white then black means Bob wins. If the colours agree, continue without replacement. If Andrew’s winning probability is x, find $\lfloor2022x\rfloor$.
Any collection of n distinct integers between 1 and 20 contains at least one pair such that one number is a multiple of the other. Find the smallest n.
A three-digit number $\overline{abc}$ (a,b,c need not be distinct) has no zero digit. If $\overline{abc},\overline{bca},\overline{cab}$ are all divisible by 7, find the sum of all possible $\overline{abc}$.
The probability of rain is 3/5. Andrew and Bella go home from school. Andrew brings an umbrella with probability 1/3; Bella does so with probability b. If it does not rain, they go together with probability c. If it rains, they go together if and only if exactly one brings an umbrella. Their probability of going together is 2/5. The minimum of $b^2+c^2$ is δ. Find $\lfloor100\delta\rfloor$.
An arrangement of the digits 0,1,2,…,9 is called cheerful when 0,1,2,3,4 occur in ascending order and 5,6,7,8,9 occur in descending order. For example 9801237465 is cheerful. If the first digit cannot be 0, how many cheerful arrangements are there?
Andrew and Bob play with 5 cards numbered 1,2,3,4,5. Andrew shuffles and places them face-down. Each round Bob chooses any 3 cards, and Andrew states the value of one of those cards. Bob may ask as many rounds as he likes. How many cards at most does he need to choose to ensure he knows the positions of all the cards?