Open problems that look elementary but not solvable by Astra: P1: Prove that {1, 2, ..., n} can be partitioned into sets of size at most 3 with sums equal to powers of 3.
16
4
142
23,404
P2: (p_ij) is a probability distribution on M x N rectangle. Prove that Pr(K random cells are in different rows or in different columns) is maximal iff (p_ij) is uniform. K <= min(M, N).

Sep 7, 2026 · 10:24 AM UTC
1
16
2,963
Sort replies: Relevant Recent Liked