My name is Erich Friedman. For 26 years, I was a Professor of Mathematics at Stetson University, located in DeLand, Florida. I retired in 2018 to spend more time on my other interests, including recreational mathematics, puzzles, trivia, and my girlfriend of 30 years. I was born in 1965 in West Lafayette, Indiana. I grew up in Indianapolis and went to North Central High School. I got my bachelor's degree from Rose-Hulman in 1987, and my Ph.D. from Cornell University in 1991, and have been at Stetson ever since.
There's more information on his website but that's enough for this post. Suffice to say that his website looks interesting with many links to mathematical topics. Eric Friedman is the author of OEIS A034838: numbers \(n\) that are divisible by every digit of \(n\). 26214 is a member of this sequence because 1, 2, 4 and 6 do indeed divide into it without remainder.
I was lead to this sequence by a link in Numbers Aplenty concerning what are colorfully called nude numbers, so called because such numbers expose some of their factors. The explanation on the Numbers Aplenty website runs like this:
Y.Katagiri calls a number nude if it is divisible by all of its digits (which should be nonzero) like \(672=6\cdot112=7\cdot96=2\cdot 336\). The number is called "nude" because it exposes some of its factors. There are only \(9039\) such numbers below one million, however there are infinite nude numbers since all repdigits are nude. The smallest nude number which contains all the odd digits is \(1117935\). Note that if a nude number contains a \(5\), then all the other digits must be odd. The smallest nude \(n\) which contains the maximal (8) number of distinct digits is \(1123449768\). The smallest triple of consecutive nontrivial nude numbers is \((1111, 1112, 1113)\). It is easy to see that there cannot be four consecutive nude numbers greater than 10.
The entry goes on to depict the smallest 3 × 3 magic square whose entries are nontrivial consecutive nude numbers (that is, not the numbers from 1 to 9). See Figure 1.
L=[]for n in [1..26124]:N=n.digits()OK=1for i in range(len(N)):if N[i]==0:OK=0breakelse:if n%N[i]!=0:OK=0breakif OK==1:L.append(n)print(L)print("The percentage of nude numbers up to",n,"is",numerical_approx(len(L)/n*100,digits=2))
The output tells us that approximately 2.9% of the numbers between 1 and 26124 are nude. Here is output:
Numbers in base-10 which are divisible by their digits are 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22, 24, 33, 36, 44, 48, 55, 66, 77, 88, 99, 111, 112, 115, 122, ... (OEIS A034838). Numbers which are divisible by the sum of their digits are called Harshad numbers: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 18, 20, 21, 24, ... (OEIS A005349). Numbers which are divisible by both their digits and the sum of their digits are 1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 24, 36, 48, 111, 112, 126, 132, 135, 144, ... (OEIS A050104). Numbers which are equal to (i.e., not just divisible by) the product of their divisors and the sum of their divisors are called sum-product numbers and are given by 1, 135, 144, ... (OEIS A038369).
No comments:
Post a Comment