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

Re: Primes from permutation of prime digits

Expand Messages
  • Mark Underwood
    ... Scrap that. It s not that surprising to me anymore. :) Mark
    Message 1 of 7 , Feb 13, 2009
    • 0 Attachment
      --- In primenumbers@yahoogroups.com, "Mark Underwood"
      <mark.underwood@...> wrote:
      >

      > Interesting. It's surprising to me that the number of odd digits
      > barely outnumbers the number of even digits in these primes with
      > maximum perms. Must be a good reason ...
      >

      Scrap that. It's not that surprising to me anymore. :)

      Mark
    • David Broadhurst
      I prefer zak(1123465789) = 152526 to zak(1023345679) = 156227 since the former does not invoke leading zeros. David
      Message 2 of 7 , Feb 14, 2009
      • 0 Attachment
        I prefer
        zak(1123465789) = 152526 to
        zak(1023345679) = 156227 since
        the former does not invoke leading zeros.

        David
      • David Broadhurst
        ... Thereafter, 11-digit primes become somewhat memory-intensive, in my simple-minded implementation, using GP s vecsort . Might Zak and/or Maximilian confirm
        Message 3 of 7 , Feb 14, 2009
        • 0 Attachment
          --- In primenumbers@yahoogroups.com, "David Broadhurst"
          <d.broadhurst@...> wrote:

          > I prefer
          > zak(1123465789) = 152526 to
          > zak(1023345679) = 156227 since
          > the former does not invoke leading zeros.

          Thereafter, 11-digit primes become somewhat memory-intensive,
          in my simple-minded implementation, using GP's "vecsort".

          Might Zak and/or Maximilian confirm that
          zak(10123457689) = 1404250
          without duplication of primes, but allowing Zak's leading zeros ?

          David
        • Maximilian Hasler
          ... yes: zak(10123457689) %1 = 2808500 2808500/2 (symmetry factor for exchange of the two 1 s) %2 = 1404250 Maximilian
          Message 4 of 7 , Feb 15, 2009
          • 0 Attachment
            > Thereafter, 11-digit primes become somewhat memory-intensive,
            > in my simple-minded implementation, using GP's "vecsort".
            >
            > Might Zak and/or Maximilian confirm that
            > zak(10123457689) = 1404250
            > without duplication of primes, but allowing Zak's leading zeros ?

            yes:
            zak(10123457689)
            %1 = 2808500
            2808500/2 \\ (symmetry factor for exchange of the two 1's)
            %2 = 1404250

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