Find the biggest integer N such that:
1. All its digits are distinct.
2. Each of these digits divides N.
Only a p&p solution requested.
Bonus: What would be the answer, if one of N"s digits were exempted from being its divider?
(In reply to re: manual solution to bonus is wrong
I have just looked up Enigma Number 1643 (New Scientist, April 20, 2011. )
It is entirely different problem, addressing divisibility, with totally different answer.
Mine was independently created by me and some by-products are already in the queue -
I am sure, broll, that you will both identify them and solve them.
Edited on October 14, 2014, 11:09 am