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
-
Find the sum of all the numbers of the input vector
55944 Solvers
-
Return the 3n+1 sequence for n
8541 Solvers
-
Project Euler: Problem 1, Multiples of 3 and 5
3756 Solvers
-
Give me Hamming on five, hold the mayo
57 Solvers
-
compress sequence into intervals
100 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!