Building the Biggest Box: Three-factor Polynomials and a Diophantine Equation
作者： Gregory Convertito , David Cruz-Uribe
DOI: 10.4169/MATH.MAG.89.3.201
关键词:
摘要: SummaryWe consider a well known calculus question, and show that the solution of this problem is equivalent to finding integer solutions Diophantine equation. We generalize which in turn leads more general give all these describe some historical background.
sci-hub.se 参考文章(5)
Vincent Coll, Jeremy Davis, Martin Hall, Colton Magnant, James Stankewicz, Hua Wang, Integer Solutions to Box Optimization Problems College Mathematics Journal. ,vol. 45, pp. 180- 190 ,(2014) , 10.4169/COLLEGE.MATH.J.45.3.180
Ralph H Buchholz, James A MacDougall, When Newton met Diophantus: A Study of Rational-Derived Polynomials and Their Extension to Quadratic Fields☆ Journal of Number Theory. ,vol. 81, pp. 210- 233 ,(2000) , 10.1006/JNTH.1999.2473
Kay Dundas, To Build a Better Box. College Mathematics Journal. ,vol. 15, pp. 30- 36 ,(1984) , 10.2307/3027427
Jim Buddenhagen, Charles Ford, Mike May, Nice Cubic Polynomials, Pythagorean Triples, and the Law of Cosines Mathematics Magazine. ,vol. 65, pp. 244- 249 ,(1992) , 10.1080/0025570X.1992.11996027
George P. Graham, Charles E. Roberts, A Diophantine Equation from Calculus Mathematics Magazine. ,vol. 62, pp. 97- 101 ,(1989) , 10.1080/0025570X.1989.11977418