Trying to find if the number is prime or not

[rigid mesa]

<@&987246399047479336> please have a look, thanks.

[wary cedar]

alr bro

don’t ping em

[cedar crown]

its a bot, and as adviced in the other thread, fix your variables,they are not correct

[limpid robin]

You haven't asked your question

[quaint lance]

I was just trying to figure out what went wrong with my code.

Question: Finding a prime number, but it doesn't give the right output.

[limpid robin]

and so, what went wrong ?

[quaint lance]

It gives me the wrong output, that means it can't identify if the number is prime, or not.

It just gives me the output, not a prime number.

Even if I put in 19, or 17.

[limpid robin]

wdym, what does it give, for which input ?

[cedar crown]

do not spoonfeed plz

[pine vector]

like whats the problem

oh ok

[quaint lance]

The code's wrong.

[cedar crown]

code is correct

[quaint lance]

Suppose I input the number 19, which is a prime number. The code however is wrong, and won't return me, '19 is not a prime number.'

[cedar crown]

maybe its doing what the definition of a prime is

[limpid robin]

what does it print ?

[quaint lance]

'19 is not a prime number.'

[limpid robin]

that's impossible

what does it print ?

[cedar crown]

it is, he's using if(VALUED%checkNumber == 0) {

[limpid robin]

Look at the print statement

[limpid robin]

so it says Number is not Prime

[quaint lance]

Yes.

[limpid robin]

look at your loop

int checkNumber = 1

so 19 % 1 == 0

[quaint lance]

I had to put 2 there.

Got it.

[limpid robin]

also

even with that, it's still not correct

but try to run your code

[quaint lance]

It's not giving me any problems so far.

[cedar crown]

try an even number

[quaint lance]

Works fine.

193 is prime, and 192 isn't. It's running well.

[limpid robin]

try 15

[quaint lance]

Shows it's a prime number.

Which it isn't.

[limpid robin]

yes

read your code again

maybe use a debugger

but try to understand how your method works

[quaint lance]

For the time being I'll use this, I'll fix other things later.

Since it's for a project.

[limpid robin]

no

this method simply doesn't work

the loop does absolutelly nothing

fix it

it will fail against any numbers that are not prime but are odd