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
-
Maximum running product for a string of numbers
2254 Solvers
-
Return a list sorted by number of consecutive occurrences
430 Solvers
-
Convert a vector of Integers into a matrix of binaries
81 Solvers
-
Temperature Conversion Utility
49 Solvers
-
Decrypt the cypher using XOR encryption (for beginners)
66 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!
