[ *July 16, 2001* ]

A Pandigital Programming Challenge

based on Amarnath Murthy's (email) sequence A061604.

A pandigital number is a number containing all ten digits from **0** to **9**.

For the sake of this topic we allow multiplicity of the digits.

Amarnath Murthy submitted integer sequence A061604 to Sloane's

database in May 2001, displaying the smallest pandigital multiples of n.

multiplicand n | multiplier m | pandigital n*m |

1 | 1023456789 | 1023456789 |

2 | 511728399 | 1023456798 |

3 | 341152263 | 1023456789 |

4 | 255864474 | 1023457896 |

5 | 204693579 | 1023467895 |

6 | 170576133 | 1023456798 |

7 | 146208114 | 1023456798 |

8 | 127932237 | 1023457896 |

9 | 113717421 | 1023456789 |

10 | 123456789 | 1234567890 |

11 | etc. | etc. |

As you can see all the pandigitals in the right column are ten (10) digits

long for these first few values of n. What I like to ask you now is to find

the smallest set (n,m) so that n*m is a pandigital number of __at least__

eleven (11) digits.

I hope you enjoy this programming challenge !