Loading ...
Sorry, an error occurred while loading the content.

Re: Lucas super-pseudoprime puzzle

Expand Messages
  • djbroadhurst
    Puzzle 2: Find an odd square-free composite integer n q 0 and V(p,q,n) = p mod n,
    Message 1 of 46 , Nov 5, 2010
    • 0 Attachment
      Puzzle 2: Find an odd square-free composite
      integer n < 443372888629441 such that there
      exist more than 10^12 integers q with n > q > 0
      and V(p,q,n) = p mod n, for every integer p.

      David
    • djbroadhurst
      ... http://physics.open.ac.uk/~dbroadhu/cert/dbmo116.out gives my 116, in the format [n, factors, number of solutions] With n
      Message 46 of 46 , Nov 9, 2010
      • 0 Attachment
        --- In primenumbers@yahoogroups.com,
        "mikeoakes2" <mikeoakes2@...> wrote:

        > > My revised count up to 2*10^10 is 116.
        > My (original) count up to 2*10^10 was 105.
        > So it must have missed 11, i.e. a bigger proportion.

        http://physics.open.ac.uk/~dbroadhu/cert/dbmo116.out
        gives my 116, in the format [n, factors, number of solutions]

        With n < 2*10^10, the record-holder for the number of solutions is
        [2214495361, [13, 17, 23, 29, 83, 181], 147407]
        which googles quite nicely, linking to
        http://www.cs.rit.edu/usr/local/pub/pga/fibonacci_pp

        David
      Your message has been successfully submitted and would be delivered to recipients shortly.