Cody

Problem 1298. P-smooth numbers

This Challenge is to find P-smooth number partial sets given P and a max series value.

A P-smooth number set of N contains a subset of 1:N integers whose prime factors are all <=P.

For P=3 and N=16: P-smooth subset is [1 2 3 4 6 8 9 12 16]. Values 5,7,10,13,14,and 15 are primes >3 or values divisible by primes>3.

vs = find_psmooth(P,N)

Sample OEIS 11-smooth numbers

Where are P-smooth numbers utilized or present themselves? Upcoming Challenge solved by P-smooth numbers.

Solve

Solution Stats

80.36% Correct | 19.64% Incorrect
Last Solution submitted on Jan 28, 2020

Problem Recent Solvers38

Suggested Problems

More from this Author236

Problem Tags

arrayfun find mod oeis primes