yu do
9 = 1 x 9 and 3 x 3. Therefore, the odd number 9 is not a prime number.
If someone says it can't, here's a counter-example. 2 + 3 = 5 This is not a proof.
It is an example that demonstrates, by its very existence, that an assertion is false. Usually experience suggests that the assertion is true: there is a large amount of supporting "evidence" but the statement has not been proven. The counter-example, though demolishes the assertion For example: Assertion: all prime numbers are odd. Counter example: 2. It is a prime but it is not odd. Therefore the assertion is false. This was a favourite "trap" at GCSE exams in the UK. Assertion: if you divide a nuber it becomes smaller. Counter example 1: 2 divided by a half is, in fact, 4. Counter example 2: -10 divided by 2 is -5 (which is larger by being less negative).
odd. odd=odd odd+odd=even odd+odd+odd=odd it keeps alternating in that fashion
yu do
9 = 3 x 3 15 = 3 x 5 etc. Any odd number that is composite. But 2 is a prime number which is not an odd number. [Wrong question: that is a counter example to all primes are odd numbers]
9 = 1 x 9 and 3 x 3. Therefore, the odd number 9 is not a prime number.
The number 2 is even as well as prime.
18436572 odd #s in front counter clockwise rotation
If someone says it can't, here's a counter-example. 2 + 3 = 5 This is not a proof.
4999 10,000. This may seem counter-intuitive to some. Go to 'Discuss Question' for the rationale behind this answer.
It is an example that demonstrates, by its very existence, that an assertion is false. Usually experience suggests that the assertion is true: there is a large amount of supporting "evidence" but the statement has not been proven. The counter-example, though demolishes the assertion For example: Assertion: all prime numbers are odd. Counter example: 2. It is a prime but it is not odd. Therefore the assertion is false. This was a favourite "trap" at GCSE exams in the UK. Assertion: if you divide a nuber it becomes smaller. Counter example 1: 2 divided by a half is, in fact, 4. Counter example 2: -10 divided by 2 is -5 (which is larger by being less negative).
1. START 2. LET counter = 0 3. LET number = 1 4. PRINT number * number 5. LET number = number + 2 6. LET counter = counter + 1 7. IF counter < 20 GOTO 4 ELSE GOTO 8 8. END
#include<stdio.h> int main () { int odd=1; int count=0; while (count++<10) { printf (%d\n", odd); odd+=2; } return 0; }
3+3=6 which is clearly not divisble by 4
Go to a Pokemon center you will see a odd computer like thing on the counter of the ground floor. Its pretty self-explanatory from then on.