Anonymous Monk has asked for the wisdom of the Perl Monks concerning the following question:
how many numbers exist, such that no two digits are the same and such that the number is divisble by each of its digits?
|
---|
Replies are listed 'Best First'. | |
---|---|
Re: Puzzle Time
by LanX (Saint) on Dec 23, 2012 at 03:47 UTC | |
by ikegami (Patriarch) on Dec 24, 2012 at 06:41 UTC | |
by Athanasius (Archbishop) on Dec 23, 2012 at 10:21 UTC | |
by LanX (Saint) on Dec 23, 2012 at 15:25 UTC | |
by Anonymous Monk on Dec 23, 2012 at 04:28 UTC | |
Re: Puzzle Time
by Athanasius (Archbishop) on Dec 23, 2012 at 03:39 UTC | |
Re: Puzzle Time
by golux (Chaplain) on Dec 23, 2012 at 05:03 UTC | |
Re: Puzzle Time
by BrowserUk (Patriarch) on Dec 23, 2012 at 03:59 UTC | |
Re: Puzzle Time
by hdb (Monsignor) on Jun 25, 2013 at 14:58 UTC | |
Re: Puzzle Time
by Anonymous Monk on Dec 23, 2012 at 02:57 UTC | |
Re: Puzzle Time
by hdb (Monsignor) on Sep 20, 2013 at 08:02 UTC |
Back to
Seekers of Perl Wisdom