[challenge] check if a number is even without modulo operator or floor devision.

Question

Modulo operator: 8/5 = 1 remainder 3
8%5 = 3

floor devision : 44//5 = 8.

Answer 1

https://code.sololearn.com/cHGu6D24r2fS/?ref=app

Answer 2

Ruby:
> 4.even?
=> true

Answer 3

One-Liner:

https://code.sololearn.com/cvmYJZf28ivm/#cpp

Answer 4

my java try

https://code.sololearn.com/c2GMyhQfPLmv/?ref=app

Answer 5

https://code.sololearn.com/cC8FCmroHcN5/?ref=app

Answer 6

https://code.sololearn.com/cl8SQUye81jc/?ref=app

Answer 7

My try:
https://code.sololearn.com/cT11r19Uol8O/?ref=app

Answer 8

@code learner
up to now the solutions are based on binary operators. I just ask myself if this "trick" works for the number 8.

Answer 9

@alfred your code works for every number!
you perfectly hide a floor devision by using integer division.
This "trick" is not possible in every language
It is allowed and ... thumbs up for you!

Answer 10

@vcc you solution counts as 1/2 - liner (-;

Answer 11

@cool codin and @paul
perfect solution. Can you do it with again to check if a number is devisible by 8?

#Edit easy for all powers of 2- it is similiar
I have no solution for other numbers yet.

Answer 12

print(["even","odd"][x&1])

Answer 13

Check
this
out!!
https://code.sololearn.com/cnhmqfb9Irk3/?ref=app

Answer 14

@infinity perfect!
now check devisible by 8 if you wanna

Answer 15

here is the solution for 8... :D
https://code.sololearn.com/cAR135H32Zcq/?ref=app

Answer 16

num & 1 ? "odd" : "even"

Answer 17

I made this code in Python that checks if one number is divisible by another.
I tried to train with exceptions but inputs don't work well on the playground, so make sure to actually write an integer.
Oh, and the code is not really elegant, I would gladly accept some advice for that
https://code.sololearn.com/cMKqsWnL61Hb/?ref=app

Answer 18

I saw the bitwise or operator today in a code from ++EviSolo and made use of it now (I am sorry it is not a oneliner):
https://code.sololearn.com/c0QEy4cmik6W/?ref=app

Answer 19

My code works for 8 now too. Just by checking the 3 most right bits.

Answer 20

Java -> int x = 10; return x/2*2 == x ? "Even" : "Odd";
Other language -> use truncate