Diophantine Equations
Автор: Stephen Fratini
Загружено: 2026-01-15
Просмотров: 4
Diophantine equations are polynomial equations with integer coefficients for which we seek integer solutions. This lesson proves several theorems related to linear Diophantine equations, and uses the results to solve several problems. Also, discussed are integer polynomials that generate prime numbers.
References
[1] Extended Euclidean algorithm, Wikipedia, https://en.wikipedia.org/wiki/Extende...
[2[ Dirichlet's theorem on arithmetic progressions, Wikipedia, https://en.wikipedia.org/wiki/Dirichl...
[3] Landau's problems, Wikipedia, https://en.wikipedia.org/wiki/Landau'...
[4] Bunyakovsky conjecture, Wikipedia, https://en.wikipedia.org/wiki/Bunyako...
[5] Prime Generating Polynomial, Wolfram MathWorld, https://mathworld.wolfram.com/Prime-G...
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
