Problem 2323. Pandigital number n°3 (Inspired by Project Euler 32)
After Problem 2319 and 2320.
An n-digit number is pandigital if it makes use of all the digits 1 to n exactly ONCE. For example, the 5-digit number 15234, is 1 through 5 pandigital.
The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital ([391867254]).
Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through n pandigital (n is given in input).
HINT1: Some products can be obtained in more than one way so be sure to only include it once in your sum.
HINT2: All in good time...
Solution Stats
Problem Comments
-
3 Comments
In the place of "Find the sum of all products whose...", I would say: "Find the number of all products whose..." ;-)
Why [] instead of 0?
Since I have kludged a solution together, can I have a hint?
Solution Comments
Show commentsProblem Recent Solvers36
Suggested Problems
-
Calculate the Levenshtein distance between two strings
1424 Solvers
-
Project Euler: Problem 5, Smallest multiple
1339 Solvers
-
Create a Multiplication table matrix...
491 Solvers
-
5517 Solvers
-
Convert given decimal number to binary number.
2070 Solvers
More from this Author43
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!