A natural number n is called a Smith number if n is a composite for which the digital
sum S(n) equals the p-digit sum Sp(n), where Sp(n) is given by the digital sum of all the
prime factors of n, counting multiplicity. For example, based on the factorization
636 = 22 · 3 · 53, we have Sp(636) = 2 + 2 + 3 + 5 + 3 = 15. Since S(636) = 6 +
3 + 6 = 15, then S(636) = Sp(636) and therefore, 636 is a Smith number.
Smith numbers were first introduced in 1982 by Wilansky [2]. We already know that
Smith numbers are infinitely many––a fact first proved in 1987 by McDaniel [1]. In a
quite recent publication [3], an alternate method for constructing Smith numbers
was introduced, involving the sequence Pk,n defined by
The established fact [3, Theorem 9] can be restated as follows.
A natural number n is called a Smith number if n is a composite for which the digitalsum S(n) equals the p-digit sum Sp(n), where Sp(n) is given by the digital sum of all theprime factors of n, counting multiplicity. For example, based on the factorization636 = 22 · 3 · 53, we have Sp(636) = 2 + 2 + 3 + 5 + 3 = 15. Since S(636) = 6 +3 + 6 = 15, then S(636) = Sp(636) and therefore, 636 is a Smith number.Smith numbers were first introduced in 1982 by Wilansky [2]. We already know thatSmith numbers are infinitely many––a fact first proved in 1987 by McDaniel [1]. In aquite recent publication [3], an alternate method for constructing Smith numberswas introduced, involving the sequence Pk,n defined byThe established fact [3, Theorem 9] can be restated as follows.
การแปล กรุณารอสักครู่..