All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Divisible by 11,111 (Posted on 2008-10-02)
How many positive 10-digit integers of the form ABCDEFGHIJ, with non leading zeroes and each letter representing a different base 10 digit from 0 to 9, are divisible by 11,111 ?

Note : Try to solve this problem analytically, although computer program/ spreadsheet solutions are welcome.

 See The Solution Submitted by K Sengupta Rating: 2.6667 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 re: Trivial Solution | Comment 4 of 6 |
(In reply to Trivial Solution by ed bottemiller)

That subtraction will approximate (within 1) the number of multiples of 11111 that exist between those two integers, but not all of those will be pandigital themselves, as some will contain duplicates of other digits while some digits are not present in a given number.
 Posted by Charlie on 2008-10-02 12:48:37

 Search: Search body:
Forums (0)