Creating Normal Numbers Using the Prime Divisors of Consecutive Integers

Jean-Marie De Koninck; Imre Kátai

doi:10.2478/udt-2023-0010

Abstract

For each integer n ≥ 2, let p₁ ≤ p₂ ≤ ··· ≤ p_kbe the complete list of the prime factors of a(n):= n(n+1). Consider the function s_n: {p₁,..., p_k}→ {0, 1} defined by s_n(p_j)= 0 if p_j| n and 1 if p_j| n + 1. Then consider the binary number h(n) := s_n(p₁) ...s_n(p_k). In an earlier paper, we proved that the number 0.h(2) h(3) h(4) ... is a binary normal number and in fact we proved the more general statement when, for a fixed integer t ≥ 2, we set a(n) := n(n +1) ··· (n + t − 1), thus allowing for the construction of a normal number in base t. Here, we give a much shorter and simpler proof of this result and then we consider a more general result when a(n) is the product of linear functions.

References

DE KONINCK, J.-M.—DOYON, N.: The Life of Primes in 37 Episodes,American Mathematical Society, Providence, RI, 2021.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: On a problem on normal numbers raised by Igor Shparlinski, Bull. Aust. Math. Soc. 84 (2011), 337–349.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: Construction of normal numbers by classified prime divisors of integers, Funct. Approx. Comment. Math. 45 (2011), no. 2, 231–253.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: Normal numbers created from primes and polynomials, Unif. Distrib. Theory 7 (2012), no. 2, 1–20.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: Some new methods for constructing normal numbers, Ann. Sci. Math. Québec 36 (2013), no. 2, 349–359.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: Construction of normal numbers by classified prime divisors of integers II, Funct. Approx. Comment. Math. 49 (2013), no. 1, 7–27.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: Using large prime divisors to construct normal numbers, Ann. Univ. Sci. Budapest Sect. Comput. 39 (2013), 45–62.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: Construction of normal numbers using the distribution of the k-th largest prime factor, J. Australian Math. Soc. 88 (2013), 158–168.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: Prime-like sequences leading to the construction of normal numbers, Funct. Approx. Comment. Math. 49 (2013), 291—302.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: Normal numbers generated using the smallest prime factor function, Ann. Math. Qué. 38 (2014), no. 2, 133–144.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: Constructing normal numbers using residues of selective prime factors of integers, Ann. Univ. Sci. Budapest. Sect. Comput. 42 (2014), 127–133.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: Normal numbers and the middle prime factor of an integer, Colloq. Math. 135 (2014), no. 1, 69–77.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: The number of prime factors function on shifted primes and normal numbers. Topics in Mathematical Analysis and Applications. In: (Themistocles M. Rassias, LászlóTóth, eds.) Springer Optim. Appl. Vol. 94, Springer, Cham., 2014, pp. 315–326.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: Complex roots of unity and normal numbers, Journal of Numbers, Vol. 2014 (June), Article ID 437814, 4 pp.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: The number of large prime factors of integers and normal numbers,Algébre et théorie des nombres, Publ. Math. Besançon Algèbre Théorie Vol. 2015, pp. 5–12.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—KÁTAI, I.: Prime factorization and normal numbers, Researches in Mathematics and Mechanics 20 (2015), no. 2, 69–80.
Search in Google Scholar Back to article
DE KONINCK, J.-M.—LUCA, F.: Analytic Number Theory: Exploring the Anatomy of Integers. Graduate Studies in Math. Vol. 134, American Mathematical Society, Providence, RI, 2012.
Search in Google Scholar Back to article
ELLIOTT, P. D. T. A.: Probabilistic Number Theory II. Central Limit Theorems. Fundamental Principles of Mathematical Sciences, Vol. 240. Springer-Verlag, Berlin-New York, (1980).
Search in Google Scholar Back to article
ROSSER, J.B.—SCHOENFELD, L.: Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64–94.
Search in Google Scholar Back to article

Creating Normal Numbers Using the Prime Divisors of Consecutive Integers

Abstract

Paradigm

My account