2 problems

Pálvölgyi's conjecture. For each $j$ such that $a_j$ is not divisible by $q$, it is possible to decide which thieves get $\lfloor a_j/q\rfloor$ and which get $\lceil a_j/q\rceil$ a…

Fair partition conjecture. Every convex polygon allows a convex fair partition into $N$ pieces for any positive integer $N$; equivalently, every convex polygon can be partitioned i…