int main (int argc, const char * argv[])
{
long long i = 1;
long long factorNumber;
printf("Please enter an integer to calculate its prime factorization! \n");
scanf("%lld", &factorNumber);
if (factorNumber == 1)
{
printf("1 has no prime factors! \n");
return 0;
}
while (!IsItPrime(factorNumber))
{
if (factorNumber % i == 0)
{
factorNumber /= i;
if (i > 1)
{
printf("%lld * ", i);
}
i = 1;
}
i++;
}
printf("%lld \n", factorNumber);
return 0;
}
int main (int argc, const char * argv[])
{
int i;
for (i = 1; i <= 50; i++) {
if (IsItPrime(i)) {
printf("%d is a prime number.\n", i);
}
}
return 0;
}
int main (int argc, const char * argv[]) {
int i;
for ( i = 1; i <= 50; i++ ) {
if ( ! IsItPrime( i ) ) {
if ( (i % 3) == 0 )
printf( "%d is not a prime number and is a multiple of 3.\n", i );
else
printf( "%d is not a prime number.\n", i );
}
}
return 0;
}
