Novel Formulae for Digit Frequency Analysis in Natural Numbers: Positional Counting and Computational Applications
DOI:
https://doi.org/10.29103/jacka.v2i4.23794Keywords:
Digit Frequency, Positional Counting, Number Theory, Radical Equations, Computational MathematicsAbstract
This research introduces a novel set of mathematical formulae for efficiently determining the frequency of individual digits within the set of natural numbers less than a given integer N. The study aims to derive a general closed-form expression that avoids iteration, based on the digit structure of N, and to develop a new positional operator for identifying digit placement within multi-digit numbers. The methodology is built on place-value analysis and the definition of a digit frequency function f(t;N), which incorporates a universal positional term fn and a helper function G(ai,t). The formula f(t;N) = fn + ∑G(ai,t) is proven to hold across numerical classes and is validated through extensive numerical testing up to 10^18. The research also introduces a novel mathematical operator, Ta = t-1, to determine the exact placement of a digit at the end of a number sequence. The results demonstrate a 92% improvement in computational efficiency compared to enumeration, with broad applications in number theory, coding, and pattern recognition. Additionally, the approach resolves a known non-linear radical system with exact solutions, showcasing the formulae's algebraic utility. In conclusion, this study contributes three new tools to mathematics: a closed-form digit frequency function, a terminal digit positional operator, and a novel solution method for radical equations.
References
[1] L. Barreira and G. Iommi, “Frequency of digits in the Lüroth expansion,” J. Number Theory, vol. 129, no. 6, pp. 1479–1490, 2009. doi: 10.1016/j.jnt.2008.06.002.
[2] L. Barreira, B. Saussol, and J. Schmeling, “Distribution of frequencies of digits via multifractal analysis,” J. Number Theory, vol. 97, no. 2, pp. 410–438, 2002. doi: 10.1016/S0022-314X(02)00003-3.
[3] B. Beber and A. Scacco, “What the numbers say: A digit-based test for election fraud,” Political Analysis, vol. 20, no. 2, pp. 211–234, 2012. doi: 10.1093/pan/mps003.
[4] D. Biau, “The first-digit frequencies in data of turbulent flows,” Physica A: Statistical Mechanics and its Applications, vol. 440, pp. 147–154, 2015. doi: 10.1016/j.physa.2015.08.016.
[5] A. Y. Burova and T. O. Usatenko, “Digital methods of discrete Fourier transform, allowing minimizing the number of algorithmic multiplication operations,” in J. Phys.: Conf. Ser., vol. 1889, no. 3, p. 032035, Apr. 2021. doi: 10.1088/1742-6596/1889/3/032035.
[6] C. K. Chui and Q. Jiang, Applied Mathematics: Data Compression, Spectral Methods, Fourier Analysis, Wavelets and Applications. Springer, 2013. doi: 10.2991/978-94-6239-009-6.
[7] A. Fettweis, “Wave digital filters: Theory and practice,” Proc. IEEE, vol. 74, no. 2, pp. 270–327, 2005. doi: 10.1109/PROC.1986.13458.
[8] T. Hagendorff, “The ethics of AI ethics: An evaluation of guidelines,” Minds & Machines, vol. 30, pp. 99–120, 2020. doi: 10.1007/s11023-020-09517-8.
[9] J. Lan et al., “Spurious suppression and frequency accuracy enhancement in direct digital frequency synthesis: Analysis, simulation, and experiment,” IEEE Trans. Instrum. Meas., 2025. doi: 10.1109/TIM.2025.3557825.
[10] B. Luque and L. Lacasa, “The first-digit frequencies of prime numbers and Riemann zeta zeros,” Proc. R. Soc. A, vol. 465, no. 2107, pp. 2197–2216, 2009. doi: 10.1098/rspa.2009.0126.
[11] R. G. McKilliam, B. G. Quinn, I. V. L. Clarkson, and B. Moran, “Frequency estimation by phase unwrapping,” IEEE Trans. Signal Process., vol. 58, no. 6, pp. 2953–2963, 2010. doi: 10.1109/TSP.2010.2045786.
[12] A. Sandryhaila and J. M. F. Moura, “Discrete signal processing on graphs: Frequency analysis,” IEEE Trans. Signal Process., vol. 62, no. 12, pp. 3042–3054, 2014. doi: 10.1109/TSP.2014.2321121.
[13] A. N. Serov et al., “Comparative analysis of digital frequency measurement methods for power networks,” in Proc. 2020 3rd Int. Colloq. Intell. Grid Metrol. (SMAGRIMET), pp. 7–14, Oct. 2020. doi: 10.23919/SMAGRIMET48809.2020.9264019.
[14] A. Shafique, M. M. Hazzazi, A. R. Alharbi, and I. Hussain, “Integration of spatial and frequency domain encryption for digital images,” IEEE Access, vol. 9, pp. 149943–149954, 2021. doi: 10.1109/ACCESS.2021.3125961.
[15] X. Yao and J. Zhao, “Chinese mathematics teachers’ use of digital technologies for instruction: A survey study,” Eur. J. Math. Sci. Technol. Educ., vol. 18, no. 8, p. em2135, 2022. doi: 10.29333/ejmste/12209.
[16] L. Yu, C. Li, L. Gao, B. Liu, and C. Che, “Stochastic analysis of touch-tone frequency recognition in two-way radio systems for dialed telephone number identification,” in Proc. 2024 7th Int. Conf. Adv. Algorithms Control Eng. (ICAACE), pp. 1565–1572, Mar. 2024. doi: 10.1109/ICAACE61206.2024.10548255
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Mohammad Tahir Mohmand
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with JACKA agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
