I want Ideas

Question

what can we do with numbers
like test it is prime or not,even or not

Answer 1

@ValentinHacker Prime numbers are numbers that can be divided only by 1 or itself. like 2, 5, 23

Answer 2

@ValentinHacker *Divided without getting a remainder ;)*

Answer 3

num%2==0 <- even
num%2!=0 <- odd

(not sure what "prime" means… /: )

Answer 4

@Gami 2 can be divided with 1.1,1.2,1.3……… ~_~

Answer 5

a for loop that tries to divide the given number with a num in range(2,number-1) and convert it to an int. If it only gave typeerror, it is a prime :)

Answer 6

you can check primes like that:

bool isPrime = true;
for(int i = 2; i <= n/2; i++){
if(n % i == 0){
isPrime = false;
break;
}
}

where n is the number that you want to check and isPrime is boolean variable that holds if n is prime or not. Note that checking n/2 numbers is enough to find if n is prime or not. Loop must start from 2 otherwise it wont work correctly. Because n % 1 == 0 will always return true. No matter what n is.

Answer 7

@ValentineHacker not including fractions...

Answer 8

@Almog Bercovitch:

Between 0 and square root of N is good enough, as if ( N == a * b ) if ( a >= n ) then ( b <= n ), so values greater than case ( a == b ) is already tested...

Answer 9

@visph clever... didnt think of that

Answer 10

@Bekir Uzun Your code has an error. Where it says "prime" should say "isPrime"

Answer 11

@Ivan Thanks. Fixed it

Answer 12

You want ideas?... I want money :P

Answer 13

for prime do a loop between 0 and N that checks if N%i==0.
if you really want tog get fancy you can make it recursive, while it does N%i only if i is prime.

Answer 14

Check the code
I expect more biodata's