Matlab Q3 Find prime numbers Write a program to examine each

Matlab

Q3. Find prime numbers.

Write a program to examine each integers from 1 to N to see if the number is a prime. If it is a prime, print out the number. You may use the Matlab function isprime(k), which returns the value true if k is prime. The program should print out all primes less than or equal to N. Use N=150 as a test case.

Please Post Code!

Solution

n = input(\'please enter a limit:\')
digits = 2: n;
primes = [];
for i = 1: length(digits)
if ~ digits(i) == 0
for j = i+1: length(digits)
if rem(digits(j), digits(i)) == 0
digits(j) = 0
end
end
end
if ~ digits(i) == 0
primes(length(primes) + 1) = digits(i)
end
end
primes

output:

digits=2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150

primes=2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149