IJPAMR International Journal of Pure and Applied Mathematics Research 2789-9160 SvedbergOpen ijpamr-1-1-005 10.51483/IJPAMR.1.1.2021.55-57 Research Paper A Theorem on Numbers of the Form 10X KumarRavin 1 * 1Department of Computer Science, Meerut Institute of Engineering and Technology, Meerut-250005, Uttar Pradesh, India. E-mail: ravin.kumar.cs.2013@miet.ac.in *Corresponding author: Ravin Kumar, Department of Computer Science, Meerut Institute of Engineering and Technology, meerut-250005, Uttar Pradesh, India. E-mail: ravin.kumar.cs.2013@miet.ac.in 10 2021 1 1 55 57 Abstract

Number theory is one of the core branches of pure mathematics. It has played an important role in the study of natural numbers. In this paper, we are presenting a theorem on the numbers of form 10X, where x ∈ ℤ+. The proposed theorem have a major application in computer science. It can be used to predict ‘n’ bits which will always represent more than 10X total numbers. We proved that the nature of the ‘n’ bits is always one of the forms 10i, 10i + 4, or 10i + 7, where i ∈ W.

 Keywords Number theory Binary Number System Modular Arithmetic 10X References FlathD.E. (2018). Introduction to Number Theory. American Mathematical Soc., AMS Chelsea Publishing, 384, 212p. Github Repository. (2019), https://github.com/mr-ravin/theorem10, last accessed 2019/7/31. InamI.BüyükaķýkE. (2019). Notes from the International Autumn School on Computational Number Theory. Springer. KraftJ.WashingtonL. (2018). An Introduction to Number Theory with Cryptography. Chapman and Hall/CRC, 1st edition, 572p. MeidânisJ. (1990). Lower Bounds for Arithmetic Problems. University of Wisconsin-Madison Department of Computer Sciences.