Write a function to determine if a number is divisible by 16. This can be done by a few different methods. Here are two:
A few of the function restrictions have been lifted.
Previous problem: divisible by 15. Next problem: divisible by n, prime vs. composite divisors.
Another trick: if the last 4 digits of the number are divisible by 16, the full number is divisible by 16. So far as I know, if the last X digits of a number are divisible by 2^X, the entire number is divisible by 2^X.
@James: nice trick! (and I guess the proof arises from 10^x being always exactly divisible by 2^x, so "iff" also applies?)
perhaps less interesting but I guess you could do the same with powers of 5, iff the last X digits of a number are divisible by 5^x, then the entire number is divisible by 5^x...
Given an unsigned integer x, find the largest y by rearranging the bits in x
577 Solvers
970 Solvers
1786 Solvers
Create a square matrix of multiples
342 Solvers
275 Solvers