this project is to determine if a phone number is a prime number. if the number is a prime number then print a message to the effect. if the number is not a prime number then print the prime factors of the number. allow the user to continue entering numbers for as long as he or she wishes.
i was given the following, but its not quite right and perhaps not quite complete:
for(count = 5; count <3; count = count +2)
{
x=0;
sq = Math.sqrt(count)
prime = true;
while(a[x]<sq,&&prime)
{
if(count % a(x) ==0)
prime = false;
else
x++;
}
if(prime)
a[index] = count;
index++;
}
