Find the prime nofrom one to ten using 'for' or 'while' loop in c language?

Answer 1

I don't know C, but the process of finding a prime is the same in any programming language # Use a sequential list of numbers from two to some maximum. (10 in your case) # Delete all multiples of 2 greater than 2 from the list. # The next lowest, uncrossed off number in the list is a Prime number. # Delete all multiples of this number from the list. This can be started at the square of the number, as lower multiples have already been crossed out in previous steps. # Repeat steps 3 and 4 until you reach a number greater than the square root of the highest number in the list; all the numbers remaining in the list are prime

Answer 2

#include <stdio.h>

int main (void)

{

int i=o;n;

n=100;

for(i=10;i<=n;i++)

{if(n%i!=0)

printf ("%d',i);}

}

Answer 3

#include<stdio.h>

int main (void) {

int x;

for (x=1; x<=10; ++x)

if (x==2 x==3 x==5 x==7)

printf ("%d is prime\n", x);

return 0

}