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

5 Solutions

4 Solvers

Last Solution submitted on Feb 24, 2023

Last 200 Solutions

Problem Comments

Solution Comments

Show comments
Loading...