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

24824Re: mod quartic composite tests

Expand Messages
  • djbroadhurst
    Jan 17, 2013
    • 0 Attachment
      --- In primenumbers@yahoogroups.com,
      "paulunderwooduk" wrote:

      > Is it a comprehensive list for all n <= 97847746461047271599?

      By no means. However the updated file
      now has more:


      print(c"/"#v" counterexamples left in "file);c;}


      422355/422355 counterexamples left in underwqd.txt

      Challenge: Find a composite 10^10-smooth positive
      integer, n, such that:
      1) there exist an integer x that passes tst(n,x),
      2) n is not in underwqd.txt.

      Comment: I do not know of any such integer. Nor do I know
      how to search for one. So I guess that means my gremlins
      are comprehensively exhausted, though the question is not.

    • Show all 26 messages in this topic