Problem 2320. Pandigital number n°2 (Inspired by Project Euler 32)
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.
Find the number of pandigital numbers in a given interval [xlower,xupper] (inclusive if it is not explicit enough).
The test suite is simple here, but how to compute this number with BIG interval (pandigital number length > 7) in Cody time?
For example, between 58755 and 99899923?
Solution Stats
Problem Comments
-
1 Comment
GeeTwo
on 8 Aug 2022
Instructions are incorrect. The instructions ask for pandigitals between the bounds, but at least the lower bound must be included to pass some of the tests.
Solution Comments
Show commentsGroup

Magic Numbers II
- 14 Problems
- 70 Finishers
- First N Perfect Squares
- Determine if input is a perfect number
- Project Euler: Problem 9, Pythagorean numbers
- Recurring Cycle Length (Inspired by Project Euler Problem 26)
- Project Euler: Problem 9, Pythagorean numbers
- Recurring Cycle Length (Inspired by Project Euler Problem 26)
- Numbers with prime factors 2, 3 and 5.
- Mersenne Primes
- Determine if input is a Narcissistic number
- Determine if input is a perfect number
- Lychrel Number Test (Inspired by Project Euler Problem 55)
- Largest Twin Primes
- Happy 2013...
- Fermat's Last Theorem - Fermat's conjecture
- P-smooth numbers
- Is it an Armstrong number?
- Champernowne Constant
Problem Recent Solvers59
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!