Page 1 of 1

Binary Representation

Posted: Wed Apr 05, 2017 1:37 pm
by Soumitra Das
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$ .

Re: Binary Representation

Posted: Thu Oct 03, 2019 1:43 am
by Ragib Farhat Hasan
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)$?