2010/02/23 by Michael Stoll, Stoll, Michael
Computer Science · Mathematics · #11D41 #11G30 #11Y50 #Computability, Logic, AI Algorithms #FOS: Mathematics #History and Theory of Mathematics #Number Theory (math.NT) #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1002.4344
openalex publication_date 2010/02/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.