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

digital quickie

Expand Messages
  • Phil Carmody
    Those who saw this elsewhere are invited not to spoil it for those who didn t. (And credit to Hauke R who posed the original.) Consider partitions of the
    Message 1 of 2 , Oct 5, 2009
    • 0 Attachment
      Those who saw this elsewhere are invited not to spoil it for those who didn't. (And credit to Hauke R who posed the original.)

      Consider partitions of the digits 0-9 into a set of decimal representations of numbers which are all exact powers of a single prime number. (As always, a leading 0 is forbidden in decimal representations, save for that of 0 itself.)

      1) Prove that all such sets have at least 2 members.
      2) Find all such sets.

      (1) is there to encourage you to do some maths before blindly hitting brute force by reducing the search space.

      Phil
      --
      () ASCII ribbon campaign () Hopeless ribbon campaign
      /\ against HTML mail /\ against gratuitous bloodshed

      [stolen with permission from Daniel B. Cristofani]
    • djbroadhurst
      ... S.S.G. set something similar, in 2005. David
      Message 2 of 2 , Oct 5, 2009
      • 0 Attachment
        --- In primenumbers@yahoogroups.com,
        Phil Carmody <thefatphil@...> wrote:

        > Hauke R who posed the original

        S.S.G. set something similar, in 2005.

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