
following: Find the prime number between 1 to 100. Prime numbers are the numbers whose only factors are 1 and the number itself clc, clear all; for- 96A loop to iterate from 1 to 100 counter-0; for num 96A loop to iterate from ‘i, to 1 f (mod(inum)–0) counter counter+1; end end if (counter-2) %for prime numbers, counter should be exactly 2 %result of mod() operation is zero only when prime number is divided
PayPal Gateway not configured
PayPal Gateway not configured