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

Re: consecutive p-smooth integers

Expand Messages
  • djbroadhurst
    ... May we see your reference? Here is mine :-) http://alexandria.tue.nl/repository/freearticles/597499.pdf David
    Message 1 of 42 , Aug 7, 2011
    • 0 Attachment
      --- In primenumbers@yahoogroups.com,
      Andrey Kulsha <Andrey_601@> wrote:

      > it's little sense to use log(N)/log(p)

      May we see your reference?

      Here is mine :-)

      http://alexandria.tue.nl/repository/freearticles/597499.pdf

      David
    • Mark
      ... Too hard! It was difficult getting just over 2 for the first time with log(287946949)/log(15823). My only consolation is that the above is also good for 15
      Message 42 of 42 , Nov 8, 2011
      • 0 Attachment
        --- In primenumbers@yahoogroups.com, Andrey Kulsha <Andrey_601@...> wrote:
        >
        > >> http://www.primefan.ru/stuff/math/maxs.xls
        > >> http://www.primefan.ru/stuff/math/maxs_plots.gif
        > >
        > > Thanks, Andrey. The gradients are fanning out better now:
        >
        > The files were updated again.
        >
        > Puzzle: find a chain of 13 consecutive p-smooth integers, starting at N,
        > with log(N)/log(p) greater than
        >
        > log(8559986129664)/log(58393) = 2.71328
        >
        > Best regards,
        >
        > Andrey
        >

        Too hard!

        It was difficult getting just over 2 for the first time with
        log(287946949)/log(15823).

        My only consolation is that the above is also good for 15 consecutive 15823-smooth integers.
      Your message has been successfully submitted and would be delivered to recipients shortly.