in this talk, we will explore several combinatorial objects whose existence depends on some (relatively) straightforward divisibility conditions. in each of these case, perhaps somewhat surprisingly, these necessary divisibility conditions are in fact sufficient. the talk will conclude by mentioned what a complete resolution is and will not require any background knowledge in combinatorics.