Found problems: 3
Vijay picks two random distinct primes $1\le p, q\le 10^4$. Let $r$ be the probability that $3^{2205403200}\equiv 1\bmod pq$. Estimate $r$ in the form $0.abcdef$, where $a, b, c, d, e, f$ are decimal digits.
Choose a point $(x,y)$ in the square bounded by $(0,0), (0,1), (1,0)$ and $(1,1)$. Your score is the minimal distance from your point to any other team's submitted point. Your answer must be in the form $(0.abcd, 0.efgh)$ where $a, b, c, d, e, f, g, h$ are decimal digits.
Gunmay picks $6$ points uniformly at random in the unit square. If $p$ is the probability that their convex hull is a hexagon, estimate $p$ in the form $0.abcdef$ where $a,b,c,d,e,f$ are decimal digits. (A [i]convex combination[/i] of points $x_1, x_2, \dots, x_n$ is a point of the form $\alpha_1x_1 + \alpha_2x_2 + \dots + \alpha_nx_n$ with $0 \leq \alpha_i \leq 1$ for all $i$ and $\alpha_1 + \alpha_2 + \dots + \alpha_n = 1$. [i]The convex hull[/i] of a set of points $X$ is the set of all possible convex combinations of all subsets of $X$.)