Description |
Consider a natural number n. Let g denote the number of ones in the binary representation of n and h denote the greatest number such that two raised to h divides n!. Then n=h+g. In the talk we will prove this and few other "surprizing" results. |