Given an input set of prime numbers (p), generate all pairs of consecutive smooth numbers (x) (see Stormer's Theorem).
For example, given p=[2 3] as input, the sorted output of all consecutive smooth numbers would be:
x= [1 2
2 3
3 4
8 9]
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers4
Suggested Problems
-
Project Euler: Problem 9, Pythagorean numbers
1386 Solvers
-
Calculate the area of a triangle between three points
3435 Solvers
-
1803 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
257 Solvers
-
5913 Solvers
More from this Author61
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!