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
-
Extract leading non-zero digit
2257 Solvers
-
Find the peak 3n+1 sequence value
2572 Solvers
-
Convert Roman to Arabic Numerals
125 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
653 Solvers
-
505 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!