TITLE

Mathematical Menopause, or, A Young Man's Game?

AUTHOR(S)
Hersh, Reuben
PUB. DATE
June 2001
SOURCE
Mathematical Intelligencer;Summer2001, Vol. 23 Issue 3, p52
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Examines the association of aging with mathematics. Concept of polynomial approximation; Productivity of mathematicians in advanced age; Impact of aging on memory loss and computing ability. INSETS: The Questionnaire;Hardy vs. Littlewood;A Young Woman's Game?;Some Numbers
ACCESSION #
6165736

 

Related Articles

  • Single machine due window assignment and scheduling with an optional maintenance activity. Wei-Xuan Li; Chuan-Li Zhao // Advanced Materials Research;2014, Vol. 1006-1007, p437 

    This paper considers single machine scheduling with general position-dependent and job-dependent aging effect. All jobs share a common due window, and an optional maintenance activity (OMA) is taken into consideration. The processing time of a job is a non-decreasing function in its position....

  • On Digital Nondeterminism. Cucker, F.; Matamala, M. // Mathematical Systems Theory;1996, Vol. 29 Issue 6, p635 

    Analyzes properties of the digital nondeterminism. Polynomial time bound; Setting of additive machines; Boolean satisfiability of linear systems.

  • RISP: REMAINDERS. Griffiths, Jonny // Mathematics Teaching;Nov2011, Issue 225, p5 

    A mathematical quiz related to determine the remainder of two integers using polynomial expression is presented.

  • Problem set 10.  // Australian Senior Mathematics Journal;2012, Vol. 26 Issue 2, p63 

    The article presents a set of mathematical problems that relate to polynomials.

  • Contents Page.  // IMRN: International Mathematics Research Notices;Jan2014, Vol. 2014 Issue 1, pNP 

    A table of contents for the January 2014 issue of "International Mathematics Research Notices" is presented.

  • Satisfaction guaranteed. Casti, John // New Scientist;07/11/98, Vol. 159 Issue 2142, p40 

    Looks at the mathematical problem of satisfiability. Definition of a satisfiability problem; How polynomial time and nondeterministic polynomial time problems differ; Question of whether the hierarchy of problems is real or illusory; How mathematicians are approaching these problems.

  • Monomiality, Lie algebras and Laguerre polynomials. Dattoli, G.; Khan, Subuhi // Journal of Applied Functional Analysis;Jan2006, Vol. 1 Issue 1, p453 

    We use the monomiality principle and the Lie algebraic methods to show that the theory of Laguerre polynomials can be framed within a different context, which allows the derivation of previously unknown properties.

  • JACOBI-WEIGHTED ORTHOGONAL POLYNOMIALS ON TRIANGULAR DOMAINS. RABABAH, A.; ALQUDAH, M. // Journal of Applied Mathematics;2009, p205 

    We construct Jacobi-weighted orthogonal polynomials Pn,r(α,βγ) (u ,v, w), α, β, γ > -1, α + β + γ = 0, on the triangular domain T. We show that these polynomials Pn,r(α,βγ) (u, v, w) over the triangular domain T satisfy the following properties:...

  • Closed polynomials and saturated subalgebras of polynomial algebras. Arzhantsev, I. V.; Petravchuk, A. P. // Ukrainian Mathematical Journal;Dec2007, Vol. 59 Issue 12, p1783 

    The behavior of closed polynomials, i.e., polynomials $$ f \in \Bbbk [x_1 , \ldots ,x_n ]\backslash \Bbbk $$ such that the subalgebra $$ \Bbbk [f] $$ is integrally closed in $$ \Bbbk [x_1 , \ldots ,x_n ] $$ , is studied under extensions of the ground field. Using some properties of closed...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics