Abstract: Inspired by the Numberphile video "The uncracked problem with 33" by Tim Browning and Brady Haran, we investigate solutions to for a few small values of . We find the first known solution for .
Recommendations
Cites work
- scientific article; zbMATH DE number 1643918 (Why is no real title available?)
- scientific article; zbMATH DE number 51347 (Why is no real title available?)
- scientific article; zbMATH DE number 819081 (Why is no real title available?)
- A Note on the Diophantine Equation x 3 + y 3 + z 3 = 3
- Modular Multiplication Without Trial Division
- New integer representations as the sum of three cubes
- New sums of three cubes
- On Solving the Diophantine Equation x 3 + y 3 + z 3 = k on a Vector Computer
- On searching for solutions of the Diophantine equation 𝑥³+𝑦³+𝑧³=𝑛
- On the Integer Solutions of the Equation x 2 +y 2 +z 2 +2xyz = n
- Solutions of the Diophantine Equation: x 3 +y 3 +z 3 =k
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- The Density of Zeros of Forms for which Weak Approximation Fails
Cited in
(8)- An observation concerning the representation of positive integers as a sum of three cubes
- Sums of cubes in quaternion rings
- Expressing three consecutive integers as sums of three cubes
- Power values of power sums: a survey
- Integral points on Markoff type cubic surfaces
- Sums of three positive cubes
- Integer polynomials expressible as sums of cubes
- Integral points on cubic surfaces: heuristics and numerics
This page was built for publication: Cracking the problem with 33
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2316144)