Cody

Problem 42454. Divisible by n, prime divisors (including powers)

Created by goc3 in Community

For this problem, you will be provided an array of numbers (not necessarily in order). Return the array of numbers with only prime divisors (including prime powers) remaining in the array. For example:

n = 1:10;
n_p = [2 3 4 5 7 8 9];

Since the prime numbers in the 1:10 range are 2, 3, 5, and 7, while the prime powers in this range are 4 (2^2), 8 (2^3), and 9 (3^2). (Ignore one, as it is a trivial case since all integers are divisible by one.) Therefore, you should return the array including both sets joined together and sorted, as shown in the example above.

Previous problem: Divisible by n, prime vs. composite divisors. Next problem: Divisible by n, prime divisors - 11, 13, 17, & 19.

Solution Stats

38.95% Correct | 61.05% Incorrect
Last solution submitted on Nov 22, 2018

Recent Solvers31

Suggested Problems

More from this Author161

Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today

MATLAB Academy

New to MATLAB?

Learn MATLAB today!