罗塔的一篇回忆埃尔德什的文字
2015-02-04 16:42
29 查看
文章来源于此
Throughout his life, Paul Erdös never seemed to age. I met him in the early sixties, and I last saw him a few months ago. He always looked the same. He spoke the same way, he dressed the same way. Only his theorems changed. In the second half of his life, all his lectures invariably had the same title: "Problems in combinatorics and number theory". The content of each lecture varied as the problems he had proposed were solved and new problems were added. He was shrewd enough to propose problems that could be solved by good mathematicians with the techniques of the day; only on occasion he would state a problem that he knew would require a genuinely new idea, and then he would offer an unusually large sum for its solution.
If we were to include among his publications those inspired by his valuable hints, we should increase the number of his published papers from fifteen hundred to tens of thousand.
Like Norbert Wiener, Erdös liked to pretend to be absent-minded, to avoid dealing with the humble chores of everyday life. His associates and collaborators were glad to plan his entire day for him, and to help him out with all that he needed, all the way to buttering his toast. But he was quick to notice when something went wrong. He always memorized his travel schedules, and did not fail to remind his hosts when the time came to drive to the airport.
He was good at sizing up people. His incisive remarks on personalities, casually stated in the middle of a mathematical argument, were invariably surprising and always true, though they never hurt.
His elementary proof of the prime number theorem (with Selberg) is often cited as some of his best work. Actually, several of his ideas are more likely to survive than many theorems: his idea of proving the existence of combinatorial objects by probabilistic methods and his infinite Ramsey theory are now two of many thriving chapters of mathematics that he initiated, and that are a long way from being concluded.
One evening in the seventies, I mentioned to Paul a problem in numerical computation I was working on. Instantly, he gave me a hint that eventually led to the complete solution. We thanked him for his help in the introduction to our paper, but I will always regret not having included his name as a coauthor. My Erdös number will now permanently remain equal to two.
Gian-Carlo Rota, Cambridge, MA, September 30, 1996
Throughout his life, Paul Erdös never seemed to age. I met him in the early sixties, and I last saw him a few months ago. He always looked the same. He spoke the same way, he dressed the same way. Only his theorems changed. In the second half of his life, all his lectures invariably had the same title: "Problems in combinatorics and number theory". The content of each lecture varied as the problems he had proposed were solved and new problems were added. He was shrewd enough to propose problems that could be solved by good mathematicians with the techniques of the day; only on occasion he would state a problem that he knew would require a genuinely new idea, and then he would offer an unusually large sum for its solution.
If we were to include among his publications those inspired by his valuable hints, we should increase the number of his published papers from fifteen hundred to tens of thousand.
Like Norbert Wiener, Erdös liked to pretend to be absent-minded, to avoid dealing with the humble chores of everyday life. His associates and collaborators were glad to plan his entire day for him, and to help him out with all that he needed, all the way to buttering his toast. But he was quick to notice when something went wrong. He always memorized his travel schedules, and did not fail to remind his hosts when the time came to drive to the airport.
He was good at sizing up people. His incisive remarks on personalities, casually stated in the middle of a mathematical argument, were invariably surprising and always true, though they never hurt.
His elementary proof of the prime number theorem (with Selberg) is often cited as some of his best work. Actually, several of his ideas are more likely to survive than many theorems: his idea of proving the existence of combinatorial objects by probabilistic methods and his infinite Ramsey theory are now two of many thriving chapters of mathematics that he initiated, and that are a long way from being concluded.
One evening in the seventies, I mentioned to Paul a problem in numerical computation I was working on. Instantly, he gave me a hint that eventually led to the complete solution. We thanked him for his help in the introduction to our paper, but I will always regret not having included his name as a coauthor. My Erdös number will now permanently remain equal to two.
Gian-Carlo Rota, Cambridge, MA, September 30, 1996
相关文章推荐
- 转自博客园的一篇关于日期格式的文字《.NET中DateTime时间格式转换(附用户定义格式)》
- 再一篇相当中肯的文字
- 文字滚动一次一行特效,类似抽奖公告.-----一天一篇文章
- 终于看到一篇 关于四元数 万向节锁 解释明白靠谱一点的文字
- 7.10 有一篇文章,共有3行文字,每行有80个字符。要求分别统计出其中英文大写字母、小写字母、数字、空格以及其他字符的个数。
- shows的心情文字(1)--“菜饭”的回忆
- 如何统计出一篇文章出现的文字个数? (中级) 使用std::vector
- 如何统计出一篇文章出现的文字个数? (高级) (使用std::map)
- 一篇初中600字作文《感恩的心》献给大家,回忆小时候的时光!
- 也写一篇关于mysql乱码的文字
- Oracle10g使用上一篇文字的测试结果
- 转的一篇,文学修养,文字表达的作用
- 一篇很好的关于View&CALayer内存优化原理的文字
- [杂言]晚来的文字,忘却的回忆——纪念我的同学汪勇
- 方向~(转自己俱乐部里的一篇文字)
- .随意输入一篇文章,并利用下列标记(标记可以自由组合)给这篇文章建立多样化的文字编排效果。 <Hn>、<FONT>、<B>、<I>、<U>、<BIG>、<SMALL>、<STRIKE>、<BR>、<P
- 有一篇文章,共有三行文字,每行有80个字符。要求分别统计出其中英文大写字母、小写字母、数字、空格以及其他字符的个数。
- 有一篇文章,共有3行文字,每行有10个字符。要求分别统计出其中英文大写字母、小写字母、数字、空格及其它字符的个数
- 有一篇文章,共有3行文字,每行有80个字符,请求帮忙,谢谢