数学家传记
卡普耶卡是一位主要靠自学成才的印度数学家,研究数论。
卡普耶卡出生于Dahanu,这是印度西海岸的一个城镇,位于孟买以北约100公里处。他八岁时母亲去世,由父亲抚养长大。他的父亲是一名职员,对占星术着迷。尽管占星术不需要高深的数学,但它确实需要相当强的数字计算能力,而卡普耶卡的父亲无疑给了儿子对计算的热爱。
卡普耶卡在Thane(有时写作Thana)上中学,该地位于孟买东北,但距离很近,实质上是一个郊区。在那里,正如他从小以来一直做的那样,他度过了许多快乐的时光来解数学谜题。1923年,他在浦那的弗格森学院开始高等教育阶段的学习。在那里他表现出色,于1927年获得数学荣誉学位考试一等及格者(Wrangler) R P Paranjpe数学奖。该奖授予学生所完成的最佳原创数学成果,而卡普耶卡获得该奖无疑是恰当的,因为他在自己所想出的数论问题中总是表现出极大的独创性。1929年,他从该学院毕业并获得理学士学位,同年他被任命为Devlali的一名学校数学教师,Devlali是一个离Nashik很近的城镇,Nashik位于他出生地Dahanu正东约100公里处。他整个职业生涯都在Devlali教书,直到1962年58岁时退休。
卡普耶卡童年时对数字的迷恋贯穿了他的一生。他是一位优秀的学校教师,用自己对数字的热爱来激励学生,并经常受邀在当地学院讲述他独特的方法。他意识到自己对数论上了瘾,他会这样形容自己:-
一个酒鬼想继续喝酒以保持那种愉悦的状态。就数字而言,我的情况也是如此。
许多印度数学家嘲笑卡普耶卡的数论思想,认为它们琐碎且不重要。他确实设法在一些低级别数学期刊上发表了一些想法,但其他论文则以小册子的形式私下出版,上面印有诸如Privately printed, Devlali或Published by the author, Khareswada, Devlali, India的题词。卡普耶卡的名字今天广为人知,许多数学家发现自己被卡普耶卡觉得如此令人上瘾的数字思想所吸引。让我们看看他引入的一些思想。
也许卡普耶卡最著名的结果与数字6174有关,今天被称为卡普耶卡常数。从任意一个四位数开始,并非所有数字都相同。假设我们选择4637(这是EFR电话号码的前四位数字!)。重新排列数字,用这些数字组成最大和最小的数,即7643和3467,用较大的数减去较小的数得到4167。用这个数继续这个过程——从7641中减去1467,我们得到6174,即卡普耶卡常数。让我们再试一次。选择3743(这是EFR电话号码的后四位数字!)。
7433 - 3347 = 4086
8640 - 0468 = 8172
8721 - 1278 = 7443
7443 - 3447 = 3996
9963 - 3699 = 6264
6642 - 2466 = 4176
7641 - 1467 = 6174
我们再次得到了卡普耶卡常数。事实上,将卡普耶卡过程应用于几乎任何四位数,最多7步后都会得到6174(所以我们最后一个例子是过程达到最大长度的一个)。这最早由卡普耶卡在1946年发现,他在1949年的马德拉斯数学会议上宣布了这一结果。他于1953年在Scripta Mathematica的论文Problems involving reversal of digits中发表了这一结果。显然,从1111开始,卡普耶卡过程将得到0。事实上,卡普耶卡过程将得到0或6174。在卡普耶卡过程下,恰好有77个四位数稳定到0,其余将稳定到6174。任何感兴趣的人都可以用超过4位的数字进行实验,看看它们是否会稳定到一个单一数字(0除外)。
卡普耶卡 还研究了数字的哪些其他性质?一个 卡普耶卡 数 是这样的: 可以分成两部分,使得这两部分之和为 。例如 。但 494 + 209 = 703。注意,当平方数被拆分时,我们可以让最右边的部分以 0 开头。例如 当然,从这个观察中我们看到有无穷多个 卡普耶卡 数(当然 9, 99, 999, 9999, ... 都是 卡普耶卡 数)。前几个 卡普耶卡 数是:
1, 9, 45, 55, 99, 297, 703, 999, 2223, 2728, 4879, 4950, 5050, 5292, 7272, 7777, 9999, 17344, 22222, 38962, 77778, 82656, 95121, 99999, 142857, 148149, 181819, 187110, 208495, ...
2000 年证明了 卡普耶卡 数与 的酉除数一一对应(如果 ,其中 和 互素,则 是 的酉除数)。当然我们考察的是十进制下的 卡普耶卡 数。同样的概念对其他进制也同样有趣。卡普耶卡 描述这些数性质的一篇论文是 [3]。
接下来我们描述 卡普耶卡 的“自数”或“Swayambhu”(见 [5])。首先我们需要描述 卡普耶卡 所称的“数字相加”。从一个数开始,比如 23。其数字之和为 5,我们将它加到 23 上得到 28。再将 2 和 8 相加得到 10,我们将它加到 28 上得到 38。继续下去得到序列
23, 28, 38, 49, 62, 70, ...
这些都由 23 生成。但 23 是由更小的数生成的吗?是的,16 生成 23。事实上,我们考察的序列实际上从 1 开始
1, 2, 4, 8, 16, 23, 28, 38, 49, 62, 70, ...
试着从 29 开始。然后我们得到
29, 40, 44, 52, 59, 73, ...
但 29 由 19 生成,19 又由 14 生成,14 由 7 生成。然而,没有任何数生成 7——它是一个自数。自数是
1, 3, 5, 7, 9, 20, 31, 42, 53, 64, 75, 86, 97, 108, 110, 121, 132, 143, 154, 165, 176, 187, 198, 209, 211, 222, 233, 244, 255, 266, 277, 288, 299, 310, 312, 323, 334, 345, ...
卡普耶卡在[5]中对自数作了其他一些评论。例如,他指出某些数由不止一个数生成——他把这些数称为交汇数。他指出101是一个交汇数,因为它由100和91生成。他评论说存在有超过2个生成元的数。可能的数字添加级数被分为三种类型:类型A的所有成员都与3互素;类型B的所有成员都能被3整除但不能被9整除;类型C的所有成员都能被9整除。卡普耶卡指出,如果x和y属于同一类型(即每个都与3互素,或每个都能被3整除但不能被9整除,或每个都能被9整除),那么它们的数字添加级数在某个点之后重合。他猜想一个数字添加级数不可能包含超过4个连续素数。
参考文献[4]和[6]考察了“Demlo数”。我们不会给出这些数的定义,但我们注意到这个名称来自1923年他在孟买到塔那线上换乘火车的车站,当时他有了研究这类数的想法。
对于我们将要考虑的由卡普耶卡研究过的最后一种类型的数,我们来看Harshad数(源自梵语,意为“极大的喜悦”)。这些是能被其各位数字之和整除的数。所以1, 2, ..., 9必定是Harshad数,接下来的几个是
10, 12, 18, 20, 21, 24, 27, 30, 36, 40, 42, 45, 48, 50, 54, 60, 63, 70, 72, 80, 81, 84, 90, 100, 102, 108, 110, 111, 112, 114, 117, 120, 126, 132, 133, 135, 140, 144, 150, 152, 153, 156, 162, 171, 180, 190, 192, 195, 198, 200, ...
人们会注意到80, 81是一对连续的Harshad数,而110, 111, 112是三个连续的Harshad数。1994年证明了不可能有21个连续的数全是Harshad数。有可能有20个连续的Harshad数,但必须找到大于的数才能找到这样的序列。另一个有趣的性质是2!, 3!, 4!, 5!, ...都是Harshad数。人们会倾向于猜想对于每个,都是Harshad数——然而这是不正确的。最小的不是Harshad数的阶乘是432!。
既是自数又是Harshad数的数是:
1, 3, 5, 7, 9, 20, 42, 108, 110, 132, 198, 209, 222, 266, 288, 312, 378, 400, 468, 512, 558, 648, 738, 782, 804, 828, 918, 1032, 1098, 1122, 1188, 1212, 1278, 1300, 1368, 1458, 1526, 1548, 1638, 1704, 1728, 1818, 1974, 2007, 2022, 2088, 2112, 2156, 2178, ...
注意2007(本文写作的年份)既是自数又是Harshad数。
对于10以外的进制,Harshad数也很有趣,我们可以问是否存在对每个进制都是Harshad数的数。这样的数只有四个:1, 2, 4和6。
我们花了相当长的时间来考察卡普耶卡研究过的数的一些不同性质。最后让我们再给出一些传记细节。我们在上面解释过,他于1962年58岁时退休。不幸的是他的妻子于1966年去世,此后他发现自己的养老金不足以维持生活。人们必须理解,尽管卡普耶卡以最节俭的方式生活,只对把醒着的时间用于研究数感兴趣。他被迫私下教授数学和科学以赚取足够的钱来生存。
我们已经看到卡普耶卡一生中如何发明了不同的数性质。然而,尽管他的许多论文在Mathematical Reviews中被评论,他并不出名。国际声誉直到1975年才到来,当时Martin Gardener在Scientific American三月刊的“数学游戏”专栏中写到了卡普耶卡和他的数。
D R Kaprekar was born in Dahanu, a town on the west coast of India about 100 km north of Mumbai. He was brought up by his father after his mother died when he was eight years old. His father was a clerk who was fascinated by astrology. Although astrology requires no deep mathematics, it does require a considerable ability to calculate with numbers, and Kaprekar's father certainly gave his son a love of calculating.
Kaprekar attended secondary school in Thane (sometime written Thana), which is northeast of Mumbai but so close that it is essentially a suburb. There, as he had from the time he was young, he spent many happy hours solving mathematical puzzles. He began his tertiary studies at Fergusson College in Pune in 1923. There he excelled, winning the Wrangler R P Paranjpe Mathematical Prize in 1927. This prize was awarded for the best original mathematics produced by a student and it is certainly fitting that Kaprekar won this prize as he always showed great originality in the number theoretic questions he thought up. He graduated with a B.Sc. from the College in 1929 and in the same year he was appointed as a school teacher of mathematics in Devlali, a town very close to Nashik which is about 100 km due east of Dahanu, the town of his birth. He spent his whole career teaching in Devlali until he retired at the age of 58 in 1962.
The fascination for numbers which Kaprekar had as a child continued throughout his life. He was a good school teacher, using his own love of numbers to motivate his pupils, and was often invited to speak at local colleges about his unique methods. He realised that he was addicted to number theory and he would say of himself:-
A drunkard wants to go on drinking wine to remain in that pleasurable state. The same is the case with me in so far as numbers are concerned.
Many Indian mathematicians laughed at Kaprekar's number theoretic ideas thinking them to be trivial and unimportant. He did manage to publish some of his ideas in low level mathematics journals, but other papers were privately published as pamphlets with inscriptions such as Privately printed, Devlali or Published by the author, Khareswada, Devlali, India. Kaprekar's name today is well-known and many mathematicians have found themselves intrigued by the ideas about numbers which Kaprekar found so addictive. Let us look at some of the ideas which he introduced.
Perhaps the best known of Kaprekar's results is the following which relates to the number 6174, today called Kaprekar's constant. One starts with any four-digit number, not all the digits being equal. Suppose we choose 4637 (which is the first four digits of EFR's telephone number!). Rearrange the digits to form the largest and smallest numbers with these digits, namely 7643 and 3467, and subtract the smaller from the larger to obtain 4167. Continue the process with this number - subtract 1467 from 7641 and we obtain 6174, Kaprekar's constant. Lets try again. Choose 3743 (which is the last four digits of EFR's telephone number!).
7433 - 3347 = 4086
8640 - 0468 = 8172
8721 - 1278 = 7443
7443 - 3447 = 3996
9963 - 3699 = 6264
6642 - 2466 = 4176
7641 - 1467 = 6174
Again we have obtained Kaprekar's constant. In fact applying Kaprekar's process to almost any four-digit number will result in 6174 after at most 7 steps (so our last example was one where the process has maximal length). This was first discovered by Kaprekar in 1946 and he announced it at the Madras Mathematical Conference in 1949. He published the result in the paper Problems involving reversal of digits in Scripta Mathematica in 1953. Clearly starting with 1111 will yield 0 from Kaprekar's process. In fact the Kaprekar process will yield either 0 or 6174. Exactly 77 four digit numbers stabilize to 0 under the Kaprekar process, the remainder will stabilize to 6174. Anyone interested could experiment with numbers with more than 4 digits and see if they stabilise to a single number (other than 0).
What about other properties of digits which Kaprekar investigated? A Kaprekar number is such that can be split into two so that the two parts sum to . For example . But 494 + 209 = 703. Notice that when the square is split we can start the right-hand most part with 0s. For example Of course from this observation we see that there are infinitely many Kaprekar numbers (certainly 9, 99, 999, 9999, ... are all Kaprekar numbers). The first few Kaprekar numbers are:
1, 9, 45, 55, 99, 297, 703, 999, 2223, 2728, 4879, 4950, 5050, 5292, 7272, 7777, 9999, 17344, 22222, 38962, 77778, 82656, 95121, 99999, 142857, 148149, 181819, 187110, 208495, ...
It was shown in 2000 that Kaprekar numbers are in one-one correspondence with the unitary divisors of ( is a unitary divisor of if where and are coprime). Of course we have looked at Kaprekar numbers to base 10. The same concept is equally interesting for other bases. A paper by Kaprekar describing properties of these numbers is [3].
Next we describe Kaprekar's 'self-numbers' or 'Swayambhu' (see [5]). First we need to describe what Kaprekar called 'Digitadition'. Start with a number, say 23. The sum of its digits are 5 which we add to 23 to obtain 28. Again add 2 and 8 to get 10 which we add to 28 to get 38. Continuing gives the sequence
23, 28, 38, 49, 62, 70, ...
These are all generated by 23. But is 23 generated by a smaller number? Yes, 16 generates 23. In fact the sequence we looked at really starts at 1
1, 2, 4, 8, 16, 23, 28, 38, 49, 62, 70, ...
Try starting with 29. Then we get
29, 40, 44, 52, 59, 73, ...
But 29 is generated by 19, which in turn is generated by 14, which is generated by 7. However, nothing generates 7 - it is a self-number. The self-numbers are
1, 3, 5, 7, 9, 20, 31, 42, 53, 64, 75, 86, 97, 108, 110, 121, 132, 143, 154, 165, 176, 187, 198, 209, 211, 222, 233, 244, 255, 266, 277, 288, 299, 310, 312, 323, 334, 345, ...
Now Kaprekar makes other remarks about self-numbers in [5]. For example he notes that certain numbers are generated by more than a single number - these he calls junction numbers. He points outs that 101 is a junction number since it is generated by 100 and by 91. He remarks that numbers exist with more than 2 generators. The possible digitadition series are separated into three types: type A has all is members coprime to 3; type B has all is members divisible by 3 but not by 9; C has all is members divisible by 9. Kaprekar notes that if x and y are of the same type (that is, each prime to 3, or each divisible by 3 but not 9, or each divisible by 9) then their digitadition series coincide after a certain point. He conjectured that a digitadition series cannot contain more than 4 consecutive primes.
References [4] and [6] look at 'Demlo numbers'. We will not give the definition of these numbers but we note that the name comes from the station where he was changing trains on the Bombay to Thane line in 1923 when he had the idea to study numbers of that type.
For the final type of numbers which we will consider that were examined by Kaprekar we look at Harshad numbers (from the Sanskrit meaning "great joy"). These are numbers divisible by the sum of their digits. So 1, 2, ..., 9 must be Harshad numbers, and the next ones are
10, 12, 18, 20, 21, 24, 27, 30, 36, 40, 42, 45, 48, 50, 54, 60, 63, 70, 72, 80, 81, 84, 90, 100, 102, 108, 110, 111, 112, 114, 117, 120, 126, 132, 133, 135, 140, 144, 150, 152, 153, 156, 162, 171, 180, 190, 192, 195, 198, 200, ...
It will be noticed that 80, 81 are a pair of consecutive numbers which are both Harshad, while 110, 111, 112 are three consecutive numbers all Harshad. It was proved in 1994 that no 21 consecutive numbers can all be Harshad numbers. It is possible to have 20 consecutive Harshad numbers but one has to go to numbers greater than before such a sequence is found. One further intriguing property is that 2!, 3!, 4!, 5!, ... are all Harshad numbers. One would be tempted to conjecture that is a Harshad number for every - this however would be incorrect. The smallest factorial which is not a Harshad number is 432!.
The self-numbers which are also Harshad numbers are:
1, 3, 5, 7, 9, 20, 42, 108, 110, 132, 198, 209, 222, 266, 288, 312, 378, 400, 468, 512, 558, 648, 738, 782, 804, 828, 918, 1032, 1098, 1122, 1188, 1212, 1278, 1300, 1368, 1458, 1526, 1548, 1638, 1704, 1728, 1818, 1974, 2007, 2022, 2088, 2112, 2156, 2178, ...
Note that 2007 (the year in which this article was written) is both a self-numbers and a Harshad number.
Harshad numbers for bases other than 10 are also interesting and we can ask whether any number is a Harshad number for every base. The are only four such numbers 1, 2, 4, and 6.
We have taken quite a while to look at a selection of different properties of numbers investigated by Kaprekar. Let us finally give a few more biographical details. We explained above that he retired at the age of 58 in 1962. Sadly his wife died in 1966 and after this he found that his pension was insufficient to allow him to live. One has to understand that this was despite the fact that Kaprekar lived in the cheapest possible way, being only interested in spending his waking hours experimenting with numbers. He was forced to give private tuition in mathematics and science to make enough money to survive.
We have seen how Kaprekar invented different number properties throughout his life. He was not well known, however, despite many of his papers being reviewed in Mathematical Reviews. International fame only came in 1975 when Martin Gardener wrote about Kaprekar and his numbers in his 'Mathematical Games' column in the March issue of Scientific American.
正文里的方括号编号指向这里,悬停即可直接看到条目。书目保留原文——译了书名反而查不到文献。
原站列出的延伸阅读与外部数据库,照原样保留,目标多为英文页面。
关于卡普耶卡的其它网站:
原站的交叉引用。指向本站已镜像专题的留在站内,其余仍指回原站。