Not sure ask someone else
Answer:
1) its because we managed to divide the answer so it is not a prime number.
2)
Code:
#include <stdio.h>
int main()
{
int i, j, n, isPrime; // isPrime is used as flag variable
/* Input upper limit to print prime */
printf("Enter your n : ");
scanf("%d", &n);
printf("Prime numbers from 1 to %d:\n", n);
/* Find all Prime numbers between 1 to n */
for(i=2; i<=n; i++)
{
/* Assume that the current number is Prime */
isPrime = 1;
/* Check if the current number i is prime or not */
for(j=2; j<=i/2; j++)
{
/*
* If i is divisible by any number other than 1 and self
* then it is not prime number
*/
if(i%j==0)
{
isPrime = 0;
break;
}
}
/* If the number is prime then print */
if(isPrime==1)
{
printf("%d,\n ", i);
}
}
return 0;
}
THE ANSWER IS C : <span>MacGregor believes the antique tea set to be a symbol ... ect.
</span>
Answer:
my nut nerd and lick it hahahahahahahhahahahahahahahhahahahhahahahahahhaahhahahah
