393

Rule (lemmy.blahaj.zone)

submitted 2 weeks ago by Persona3Reload to c/196

57 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[-] superkret@feddit.org 45 points 2 weeks ago

Just divide the number into its prime factors and then check if one of them is 2.

[-] fartripper@lemmy.ml 20 points 2 weeks ago* (last edited 2 weeks ago)

or divide the number by two and if the remainder is greater than

-(4^34)

but less than

70 - (((23*3*4)/2)/2)

then

true

[-] superkret@feddit.org 8 points 2 weeks ago

What if the remainder is greater than the first, but not less than the latter?

Like, for example, 1?

[-] prime_number_314159@lemmy.world 3 points 2 weeks ago

Then you should return false, unless the remainder is also greater than or equal to the twenty second root of 4194304. Note, that I've only checked up to 4194304 to make sure this works, so if you need bigger numbers, you'll have to validate on your own.

[-] fartripper@lemmy.ml 5 points 2 weeks ago

i hate to bring this up, but we also need a separate function for negative numbers

[-] prime_number_314159@lemmy.world 1 points 2 weeks ago

You can just bitwise AND those with ...000000001 (for however many bits are in your number). If the result is 0, then the number is even, and if it's 1, then the number is odd. This works for negative numbers because it discards the negative signing bit.

[-] tipicaldik@lemmy.world 15 points 2 weeks ago

I remember coding actionscript in Flash and using modulo (%) to determine if a number was even or odd. It returns the remainder of the number divided by 2 and if it equals anything other than 0 then the number is odd.

[-] Korne127@lemmy.world 25 points 2 weeks ago

Yeah. The joke is that this is the obvious solution always used in practise, but the programmer is that bad that they don't know it and use some ridiculous alternative solutions instead.