Using For loop to determine if a number is prime

4 次查看（过去 30 天）
Vy Do
Vy Do 2020-9-12
编辑： Matt J 2020-9-13
Could someone help me with this problem: "Use a for loop combined with an if statement to whether 3257861 is prime."
My professor also gave the hint but it just made me more confused: "To determine if a number n is prime, you have to check every number up to and including sqrt(n) and see whether that number is a divisor of n. Also, you will need to create a variable that tells you whether you have found a divisor of 3257861 (in which case 3257861 is not prime). This variable should start at 0, and if you find a divisor, change it to 1."

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

回答（1 个）

Matt J
Matt J 2020-9-12
编辑：Matt J 2020-9-13
To determine if a number n is prime, you have to check every number up to and including sqrt(n) and see whether that number is a divisor of n.
The reason this is true is because suppose a number n is not prime. There therefore exists two integer divisors a>=b>1 such that n=a*b. Then,
n=a*b>=b^2
and therefore b<=sqrt(n). Therefore, if n is not prime, you should have found one of its divisors if you checked all b from 2 to floor(sqrt(n)).
  2 个评论
Matt J
Matt J 2020-9-13
As you have been instructed, with a for-loop and an if statement. You can use rem() or mod() to check whether a number b is a divisor of n.

请先登录，再进行评论。

类别

在 Help Center 和 File Exchange 中查找有关 Loops and Conditional Statements 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by