Info

此问题已关闭。 请重新打开它进行编辑或回答。

Matlab code for finding prime numbers

3 次查看（过去 30 天）
Aaron Millan
Aaron Millan 2021-4-29
关闭： Stephen23 2021-4-29
I wrote a code for the sieve of erasthosenes (a way to find and arrange all the prime numbers before a user-defined value, "n", both by dividing the numbers by all the pervious numbers, and by only going up to the square root of n), but the grader was not satisfied with my code. I'm not sure what I did wrong to his eyes. Any ideas? Please and thank you!
function p = prime_seive(n)
p = [0 2:n];
for k = 2:sqrt(n)
if p(k)
p(k^2:k:n) = 0;
end
end
p = p(p ~= 0);
end

此问题已关闭。

回答（0 个）

此问题已关闭。

标签

产品


版本

R2020b

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by