pith. sign in

arxiv: 1002.4344 · v2 · submitted 2010-02-23 · 🧮 math.NT

How to Solve a Diophantine Equation

classification 🧮 math.NT
keywords solvediophantineequationdemonstrateequationsevidenceextendedgave
0
0 comments X
read the original abstract

These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one can solve a specific equation related to numbers occurring several times in Pascal's Triangle with state-of-the-art methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.