Divisible by nine digits

From Math Puzzle Wiki
Revision as of 19:08, 13 July 2010 by Oscarlevin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

I found this one on the pzzls.com site

Puzzle

Find a number consisting of 9 digits in which each of the digits from 1 to 9 appears exactly once. This number should satisfy the following requirements:

  1. The number should be divisible by 9.
  2. If the most right digit is removed, the remaining number should be divisible by 8.
  3. If then again the most right digit is removed, the remaining number should be divisible by 7.
  4. etc. until the last remaining number of one digit which should be divisible by 1.

References

pzzls - nice site with a good variety of math and logic puzzles, as well as some others.