Cracking the problem with 33
From MaRDI portal
Publication:2316144
DOI10.1007/S40993-019-0162-1zbMATH Open1472.11093arXiv1903.04284OpenAlexW2963095529MaRDI QIDQ2316144FDOQ2316144
Authors: Andrew R. Booker
Publication date: 26 July 2019
Published in: Research in Number Theory (Search for Journal in Brave)
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 .
Full work available at URL: https://arxiv.org/abs/1903.04284
Recommendations
Cites Work
- Modular Multiplication Without Trial Division
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- A Note on the Diophantine Equation x 3 + y 3 + z 3 = 3
- On searching for solutions of the Diophantine equation 𝑥³+𝑦³+𝑧³=𝑛
- The Density of Zeros of Forms for which Weak Approximation Fails
- New sums of three cubes
- On Solving the Diophantine Equation x 3 + y 3 + z 3 = k on a Vector Computer
- New integer representations as the sum of three cubes
Cited In (4)
Uses Software
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)