Building the Biggest Box: Three-factor Polynomials and a Diophantine Equation

DOI10.4169/MATH.MAG.89.3.201MaRDI QIDQ4961625zbMATH OpenOpenAlexFDO

Authors Gregory Convertito, D. Cruz-Uribe

Publication date 25 October 2018

Published in Mathematics Magazine (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4169/math.mag.89.3.201

Mathematics Subject Classification ID

Quadratic and bilinear Diophantine equations (11D09) One-variable calculus (26A06)

Recommendations

• Solutions to diagonal congruences with variables restricted to a box
• On solutions to some polynomial congruences in small boxes
• On polynomial-factorial diophantine equations
• The polynomial box
• A polynomial variant of a problem of Diophantus and its consequences
• A Polynomial Analogue of the 3n + 1 Problem
• scientific article; zbMATH DE number 4079520
• On searching for solutions of the Diophantine equation 𝑥³+𝑦³+𝑧³=𝑛
• On the diophantine equation x3 + y3 + z3 = q

Cites work

• A Diophantine Equation from Calculus
• From Calculus to Number Theory
• scientific article; zbMATH DE number 928863 (Why is no real title available?)
• scientific article; zbMATH DE number 3079691 (Why is no real title available?)
• Integer solutions to box optimization problems
• Nice Cubic Polynomials, Pythagorean Triples, and the Law of Cosines
• When Newton met Diophantus: a study of rational-derived polynomials and their extension to quadratic fields.

Cited in

(3)

• Integer solutions to box optimization problems
• scientific article; zbMATH DE number 3987357 (Why is no real title available?)
• On the area and volume of a certain regular solid and the Diophantine equation 12= 1x+ 1y+ 1z

This page was built for publication: Building the Biggest Box: Three-factor Polynomials and a Diophantine Equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4961625)