Donald J. Newman
Template:Short description Template:Redirect Template:Infobox scientist Donald Joseph (D. J.) Newman (July 27, 1930 – March 28, 2007) was an American mathematician. He gave simple proofs of the prime number theorem and the Hardy–Ramanujan partition formula. He excelled on multiple occasions at the annual Putnam competition while studying at City College of New York and New York University, and later received his PhD from Harvard University in 1953.[1]
Life and works
Newman was born in Brooklyn, New York in 1930, and studied at New York's Stuyvesant High School.[2] When he was 14 he worked with Dubble Bubble Gum to help solve the statistical question of how often a gum purchaser would receive the same joke for their gum wrapper.[3] He was an avid problem-solver, and as an undergraduate was a Putnam Fellow all three years he took part in the Putnam math competition; only the third person to attain that feat.[4] His mathematical specialties included complex analysis, approximation theory and number theory. In 1980 he found a short proof of the prime number theorem, which can now be found in his textbook on Complex analysis.[5] He also gave a simplified proof of the Hardy-Ramanujans partition formula.[6]
Newman was a friend and associate of John Nash.[7]Template:Rp His career included posts as a Professor of Mathematics at MIT, Brown University, Yeshiva University, Temple University and a distinguished chair at Bar Ilan University in Israel.[8]
Newman's love of problem solving comes through in his writing; his published output as a mathematician includes 150 papers and five books. He taught numerous students over the years, including Robert Feinerman, Jonah Mann, Eli Passow, Louis Raymon, Joseph Bak, Shmuel Weinberger, and Gerald Weinstein at Yeshiva University, and Bo Gao, Don Kellman, Jonathan Knappenberger, and Yuan Xu at Temple University.
See also
- A Beautiful Mind (1998) by Sylvia Nasar
Selected publications
- Template:Cite journal
- Template:Cite journal
- --. (1979) Approximation with rational functions. Providence, RI: Conference Board of the Mathematical Sciences by the American Mathematical Society. Template:Isbn.
- Template:Cite journal
- --. (1982) A problem seminar. New York: Springer. Template:Isbn.
- --. (1998) Analytic number theory. New York: Springer. Template:Isbn (#177 in the Graduate Texts in Mathematics series).
- (1996) Complex Analysis. (2004 update w/ Joseph Bak)
- with Robert P. Feinerman: (1974) Polynomial approximation. Baltimore: Williams & Wilkins. Template:Isbn.[9]
Papers and monographs
- The Hexagon Theorem (1982 [1])
- Finite type functions as limits of exponential sums (1974, MRC technical summary report)
- Splines and the logarithmic function (1974, MRC)
- Thought Less Mathematics, an essay on why branching thinking and similar solutions aren't central to mathematics and may even obscure deeper ideas
References
External links
- ↑ Though The Math Genealogy Project lists it as 1958.
- ↑ Template:Cite web
- ↑ Forrester, Gilda Newman. “Interview about Donald J Newman.” 29 October 2017. Interviewed Newman's sister
- ↑ See Joseph Gallian's history of the competition Template:Webarchive and the official MAA record
- ↑ Joseph Bak, and D.J.Newman, Complex analysis. (Undergraduate Texts in Mathematics), Springer Verlag, 3rd edition, 2010.
- ↑ Template:Cite journal
- ↑ Template:Cite book
- ↑ Template:Cite web
- ↑ Template:Cite journal