Calculating prime numbers using mod

4 次查看（过去 30 天）
Jose Trevino
Jose Trevino 2016-2-15
评论： Jose Trevino 2016-2-15
Hi, I have a code that its supposed to calculate all prime numbers from an input of n numbers. However, in the first loop, the code uses "mod" to check if the number is divisible by any number from 2 to sqrt of n and after dividing by 2 it does not proceed to 3 and discard multiples of 3, 5 and so for. How can I fix this issue?
n = 20;
L = 2:n;
index = 2;
for k = 2:floor(sqrt(n))
while index < n
if (mod(L(index),k) == 0)
L(index) = 0;
end
index = index + 1;
end
end
L';
Prime=L(L~=0);
Prime'

请先登录，再回答此问题。

回答（1 个）

Walter Roberson
Walter Roberson 2016-2-15
You need to reset index at the beginning of the for loop.

类别

在 Help Center 和 File Exchange 中查找有关 Matrix Indexing 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by