3 ms·
No bitmask will give you divisibility by 3 in base 16 In this case (division by 3 in mod 16) is the same as base 10: if the sum of digits is divisible by 3 the
by raverbashing 6y ago
No bitmask will give you divisibility by 3 in base 16
In this case (division by 3 in mod 16) is the same as base 10: if the sum of digits is divisible by 3 then it is divisible (and the "extra digits" are 'c' and 'f')
Examples:
0x3c (60) -> sum = 0xf (divisible)
0x2d (45) -> sum = 0xf (divisible)