http://openproblemgarden.org/op/covering_systems_with_big_moduli Comments for "Covering systems with big moduli" en http://openproblemgarden.org/op/covering_systems_with_big_moduli <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/erdos">Erdos</a>; <a href="/category/selfridge_john_l">Selfridge</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/number_theory_0">Number Theory</a> » <a href="/category/combinatorial_number_theory">Combinatorial N.T.</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Problem</b>&nbsp;&nbsp; Does for every integer <img class="teximage" src="/files/tex/e178f13e28934a284e7c8f31e0187aee6ebdf650.png" alt="$ N $" /> exist a <a href="http://en.wikipedia.org/wiki/covering system">covering system</a> with all moduli distinct and at least equal to~<img class="teximage" src="/files/tex/e178f13e28934a284e7c8f31e0187aee6ebdf650.png" alt="$ N $" />? </div> </tr></td> </table> </td> </tr> </table> Erdos, Paul Selfridge, John L. covering system Number Theory Combinatorial Number Theory http://openproblemgarden.org/op/covering_systems_with_big_moduli#comment Sat, 04 Aug 2007 11:09:36 +0200 Robert Samal 493 at http://openproblemgarden.org