MATLAB: For the prime number HW

homework

Best Answer

In answer to the question "Why the for loop ends on sqrt(n) and not on (n)?", a number is not prime if and only if it has at least two positive integer factors each greater than one. These can't all be greater than sqrt(n), for otherwise their product would exceed n. Hence if all j values from 1 to sqrt(n) are tried for a non-prime n, one of those factors must have been encountered. There is no need to go any further.

Second observation: the code you display is not matlab code.

Related Solutions

MATLAB: Write a function ShowPrimes(n) that will find all prime numbers between 1 and n and return them as a vector. Do this using a for loop. Hint: use isprime(x) to check whether x is a prime number. As an example, >> primes=ShowPrimes(20) primes =

Hello,

The idea is that you use isprime to check is this prime or not.

Then, if it is the prime, you store the value of "i" (not isprime(i)) to the output.

MATLAB: How to display all prime numbers between two number input by user

n = firstnumber : secondnumber;
p = isprime(n);
n(p)    %displays the primes

Best Answer

Related Solutions

MATLAB: Write a function ShowPrimes(n) that will find all prime numbers between 1 and n and return them as a vector. Do this using a for loop. Hint: use isprime(x) to check whether x is a prime number. As an example, >> primes=ShowPrimes(20) primes =

MATLAB: How to display all prime numbers between two number input by user

Related Question