PRIME NUMBERS BETWEN 60,70 - The Learning Company Achieve! Math & Science Grades 1-3 (381933) for PC, Mac

The NEWYES NY-991MS and CTIFREE fx-991ES PLUS calculators do not have a dedicated "FACT" button like the Casio FX-83GTX. However, you can still find prime numbers on these calculators.
To find prime numbers:
NEWYES NY-991MS:
Press the "MODE" button.
Choose "PRIME" from the list of options.
Enter the desired number and press "=" to check if it's prime.
CTIFREE fx-991ES PLUS:
Press the "MODE" button.
Select "TABLE" or "TABLESET."
Input a starting point and an ending point, then observe the table for prime numbers.
Although the techniques may vary from those used on the Casio FX-83GTX, they prove to be effective for prime number calculations on the designated calculators.

Hi
Here we go
52 - can be divided by 2 - therefore NOT Prime
63 - can be divided by 3 - therefore NOT Prime
75 - can be divided by 5 - therefore NOT Prime
31 - cannot be divided by whole numbers - therefore Prime
77 - can be divided by 7 - therefore NOT Prime
59 - cannot be divided by whole numbers - therefore Prime
87 - cannot be divided by whole numbers - therefore Prime
Hope this is helpful, if so would you please register that with Fixya
Cheers

Here is a link to Wikipedia. Read the article and select what seems interesting to you.

Prime number Wikipedia the free encyclopedia

There are an infinite number of prime numbers, so I can't list them all. For the first 500 prime numbers, see http://en.wikipedia.org/wiki/List_of_prime_numbers#The_first_500_prime_numbers

A prime number is a positive whole number (natural number) which cannot be divided into smaller whole numbers. In short, it can only be divided (integer division) by itself and 1.
First prime number is 2, then 3, 5, 7, 11, 13, 17, 19,
To generate a list of prime numbers the Greek Eratoshenes used a method called now the sieve Eratosthenes.

1. Write all the natural numbers up to some chosen limit (100, 259, any limit )
2. Remove 1 by crossing it ( 1 is no longer considered prime).
3. The first prime number is 2. Circle the number 2.
4. Go through the whole list crossing out all the numbers that are multiple of 2, that is 4, 6, 8,10,12, ...
5. Repeat.
6. The next prime number is 3 since it was not crossed out as a multiple of 2. Circle 3.
7. Go through the whole list crossing all the numbers that are multiples of 3, and which have not already been crossed out as multiples of 2 .
8. Number 4 has been crossed out already.
9. Next prime number is 5. Circle 5
10. Go through the whole list crossing all the numbers that are multiple of 5 and which have not been crossed out already as multiples of 2, or 3
11. Repeat:
12. Next prime number is 7. Circle 7
13. Go through the whole list again, crossing out the multiples of 7, and so on.

If you want to test the primality of a positive integer (odd number) starting by dividing it by 3 (use divisibility rules or otherwise), then divide by 5, by seven, and all subsequent prime numbers. If it is not divisible by any prime number, keep going but do not exceed the prime number that is closest yet smaller than square root of your number.

Enjoy.

Sure you can if the numbers are right example rim size would be 14,15,16, inch then you have the witht of the tire 60,70,and the big fatt 80, and of course you have the tire height from the rim. They should be checked by the tire guy to make sure.

Prime numbers are those numbers (greater than 1) that cannot be divided by any number except themselves and one.
The Greek Eratosthenes created a method to find out these prime numbers, although it only worked over a limited range:
1) Write out the numbers from 1 to 100 in ten rows of 10.

2) Cross off number 1, because all primes are greater than 1.
3) Number 2 is a prime, so we can keep it, but we need to cross off the multiples of 2 (i.e. even numbers).
4) Number 3 is also a prime, so again we keep it and cross off the multiples of 3.
5) The next number left is 5 (because four has been crossed off), so we keep it and cross of the multiples of this number.
6) The final number left in the first row is number 7, so cross off its multiples.
7) You have finished. All of the "surviving" numbers (coloured in white below) on your grid are prime numbers.

No not all odd numbers are prime numbers. A prime number is one that cannot be divided equally by any other number then itself or 1. Therefore numbers such as 9 is not a prime number because it can also be evenly divided by 3Hope this answers your question. Thank you.

#include<stdio.h>
#include<conio.h>
void main()
{
int n,i,rem,prime,primchk=1,chk;
clrscr();
printf("\nEnter the limit\n");
scanf("%d",&n);
printf("\n\n\nThe prime numbers are\n");
printf("\n2\t3\t");
for(primchk=1;primchk<=n;primchk++)
{
for(i=2;i<primchk;i++)
{
if(primchk%i==0)
{
chk=1;
chk=0;
break;
}
if(i==primchk-1)
{
if(chk==0)
{
printf("%d\t",primchk);
chk=0;
}
}
}
}
getch();
}

Prime numbers can be calculated by using recursive algorithm
int i,j=1;
i++;
for (j=2;j<i;j++)
{
If (i%j==0)printf(" %d number is prime",&i );
else printf(" %d number is not prime",&i);
i++;
delay(20);
}
Ctrl break to terminate execution or other