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
-
Remove all the words that end with "ain"
2729 Solvers
-
1445 Solvers
-
765 Solvers
-
Create the following sequence : 0 1 1 4 9 25 64 169 ...
206 Solvers
-
Numbers spiral diagonals (Part 2)
214 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!