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
-
30193 Solvers
-
Find the alphabetic word product
3460 Solvers
-
Sum all integers from 1 to 2^n
17523 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2840 Solvers
-
Approximation of Pi (vector inputs)
276 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!