Problem 1298. P-smooth numbers

• Created by Richard Zapor
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Probability & Stats

• 30 Problems
• 3 Finishers

Randomness

• 11 Problems
• 21 Finishers

Like (1)

Difficulty:

(97)

Rate

• Solve Later   
• Add To GroupÂ

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

77.52% Correct | 22.48% Incorrect

• 129 Solutions
• 89 Solvers

Last Solution submitted on May 31, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers89

Suggested Problems

• Back and Forth Rows

  6893 Solvers

• Summing Digits within Text

  2558 Solvers

• "Low : High - Low : High - Turn around " -- Create a subindices vector

  551 Solvers

• Polygonal numbers

  130 Solvers

• Inscribed Pentagon?

  298 Solvers

More from this Author308

• ICFP2021 Hole-In-Wall: Figure Validation with Segment Crossing Check

  2 Solvers

• Maximum Intra-Vector Swaps

  7 Solvers

• Is 3D point set Co-Planar?

  23 Solvers

• USC Spring 2012 ACM: Armageddon

  10 Solvers

• PONG 002: Rectangle, Interactive Download, Easier Play

  4 Solvers