Problem #3: Hamming's weight

Solved by 1 people. Submitted 1 time.

For a given integer \(n\), define \(h(n)\) as the number of \(1\)s in the binary representation of \(n\).

And define $$F(N) = \displaystyle \sum_{n=0}^{2^N - 1} (-1)^{h(n)} \cdot 17^n \pmod {17^7 - 1}$$

Find \(F(75)\).


Log in to submit a solution.

Problem 2

Problem 4