http://openproblemgarden.org/op/lucas_numbers_modulo_m Comments for "Lucas Numbers Modulo m" en http://openproblemgarden.org/op/lucas_numbers_modulo_m#comment-75595 <p>This problem has been solved: http://mathacadabra.com/Items2013/LucasCompleteResidue.aspx</p> Tue, 01 Jul 2014 18:59:55 +0200 Anonymous comment 75595 at http://openproblemgarden.org http://openproblemgarden.org/op/lucas_numbers_modulo_m <table cellspacing="10"> <tr> <td> Author(s): <a href="/kpz_equation_central_limit_theorem"></a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/number_theory_0">Number Theory</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Conjecture</b>&nbsp;&nbsp; The sequence {L(n) mod m}, where L(n) are the Lucas numbers, contains a complete residue system modulo m if and only if m is one of the following: 2, 4, 6, 7, 14, 3^k, k >=1. </div> </tr></td> </table> </td> </tr> </table> Lucas numbers Number Theory http://openproblemgarden.org/op/lucas_numbers_modulo_m#comment Mon, 19 Mar 2012 15:38:53 +0100 Martin Erickson 37402 at http://openproblemgarden.org