Use 50% Discount for all private proxies!
Unlimited possibilities with ExtraProxies

Question in a paper by erdos on divisibility properties of central binomial coefficient

In this paper by erdos, at the beginning of the proof of theorem $ 1$ he considers the case where both $ \log p$ and $ \log q$ are commensurable numbers(which means that $ p=r^{l}$ and $ q=r^{m}$ ) enter image description here

Further states that any sum $ \sum_{i}r^{n_{i}kl}$ has all the digits either $ 0$ or $ 1$ to both the bases $ p$ and $ q$ . I didn’t get this line particularly. Why is he taking $ 0$ and $ 1$ as the digits and what is $ n_{i}$ ?

Related Posts
DreamProxies 100 Proxies 200 Proxies 400 Proxies 1000 Proxies 2000 Proxies 5000 Proxies 10000 Proxies

Garuda138 Ajaib88 Asia77

Ganas69 Uber77 Gacor77