Loading web-font TeX/Main/Regular

Problem #301

Bi-Power

How many numbers exists between 0 to 2^{N}-1 which are divisible by 3 and satisfy the divisibilty test for 3 in their binary representation as well. Report the answer modulo 1000000007 for N=123456789.

Contributed by Ashutosh Singh

Solved by 32 users

Log in to submit answers.

Is something wrong?

Maintaining a collection of high quality questions is our top priority. If, however, you do find an error, report the problem and we'll make sure it is reviewed soon.