Jump to content
BrainDen.com - Brain Teasers
  • 1

Thank goodness, no remainder is chasing me


Go to solution Solved by Pickett,

Question

Ten years ago I called attention to a number that when divided by a single integer p it left a remainder of p-1. (Help, a remainder is chasing me) Here is a chance to construct a nine-digit number, a permutation of { 1 2 3 4 5 6 7 8 9 } that has no remainders, sort of. The task is to permute { 1 2 3 4 5 6 7 8 9 } to create a number whose first n digits is a multiple of n for any single-digit n.

For example, consider 123654987. Its first 2 digits (12) are divisible by 2. It's first 5 digits (12365) are divisible by 5.

However this is not a solution, since 1236549 is not a multiple of 7.

  • Like 1
Link to post
Share on other sites

2 answers to this question

Recommended Posts

  • 0
On 2/8/2018 at 10:40 AM, Pickett said:
  Reveal hidden contents

 

Close, check the second case.

Brain fart. Nice solution.

Link to post
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Answer this question...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

Loading...
  • Recently Browsing   0 members

    No registered users viewing this page.

×
×
  • Create New...