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 Solvers6
Suggested Problems
-
The Goldbach Conjecture, Part 2
2421 Solvers
-
6722 Solvers
-
306 Solvers
-
61 Solvers
-
Big numbers, least significant digits
109 Solvers
More from this Author65
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!