Binary Representation
- Soumitra Das
- Posts:5
- Joined:Mon Apr 03, 2017 1:59 pm
Let for any positive integer $n$,$B(n)$ be the number of 1's in it's binary representation.Prove that $$B(nm) \geq \max{B(n),B(m)}$$ ,where $n,m \in N$ .
-
- Posts:62
- Joined:Sun Mar 30, 2014 10:40 pm
Re: Binary Representation
Can you explain the RHS of the equation $B(nm) \geq \max{B(n),B(m)}$ ?
I mean, do we multiply or, add or, individually consider the maximum values of $B(n)$ and $B(m)$?
I mean, do we multiply or, add or, individually consider the maximum values of $B(n)$ and $B(m)$?