"디오판투스 방정식"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
60번째 줄: 60번째 줄:
 
* [http://books.google.com/books?id=QugvF7xfE-oC Diophantine equations]
 
* [http://books.google.com/books?id=QugvF7xfE-oC Diophantine equations]
 
** Mordell, L. J. (1969)
 
** Mordell, L. J. (1969)
 +
 +
 +
== 노트 ==
 +
 +
===위키데이터===
 +
* ID :  [https://www.wikidata.org/wiki/Q905896 Q905896]
 +
===말뭉치===
 +
# Diophantine equation, equation involving only sums, products, and powers in which all the constants are integers and the only solutions of interest are integers.<ref name="ref_620634e0">[https://www.britannica.com/science/Diophantine-equation Diophantine equation | mathematics]</ref>
 +
# Congruence methods provide a useful tool in determining the number of solutions to a Diophantine equation.<ref name="ref_620634e0" />
 +
# Linear Diophantine equation in two variables takes the form of \(ax+by=c,\) where \(x, y \in \mathbb{Z}\) and a, b, c are integer constants.<ref name="ref_6745cace">[https://math.libretexts.org/Courses/Mount_Royal_University/MATH_2150%3A_Higher_Arithmetic/5%3A_Diophantine_Equations/5.1%3A_Linear_Diophantine_Equations 5.1: Linear Diophantine Equations]</ref>
 +
# : Solve the Homogeneous linear Diophantine equation \(6x+9y=0, x, y \in \mathbb{Z}\).<ref name="ref_6745cace" />
 +
# Use the following steps to solve a non-homogeneous linear Diophantine equation.<ref name="ref_6745cace" />
 +
# Finding the solution or solutions to a Diophantine equation is closely tied to modular arithmetic and number theory.<ref name="ref_bbcbc179">[https://artofproblemsolving.com/wiki/index.php/Diophantine_equation Art of Problem Solving]</ref>
 +
# A Diophantine equation in the form is known as a linear combination.<ref name="ref_bbcbc179" />
 +
# The solutions to the diophantine equation correspond to lattice points that lie on the line.<ref name="ref_bbcbc179" />
 +
# Sometimes, modular arithmetic can be used to prove that no solutions to a given Diophantine equation exist.<ref name="ref_bbcbc179" />
 +
# A linear Diophantine equation is an equation of the first-degree whose solutions are restricted to integers.<ref name="ref_de913260">[https://medium.com/cantors-paradise/famous-diophantine-equations-84073467d366 Famous Diophantine Equations]</ref>
 +
# This Diophantine equation was first studied extensively by Indian mathematician Brahmagupta around the year 628.<ref name="ref_de913260" />
 +
# A linear Diophantine equation equates to a constant the sum of two or more monomials, each of degree one.<ref name="ref_31d5bbbd">[https://en.wikipedia.org/wiki/Diophantine_equation Diophantine equation]</ref>
 +
# The simplest linear Diophantine equation takes the form ax + by = c, where a, b and c are given integers.<ref name="ref_31d5bbbd" />
 +
# A homogeneous Diophantine equation is a Diophantine equation that is defined by a homogeneous polynomial.<ref name="ref_31d5bbbd" />
 +
# If a Diophantine equation has as an additional variable or variables occurring as exponents, it is an exponential Diophantine equation.<ref name="ref_31d5bbbd" />
 +
# We call a “Diophantine equation” to an equation of the form, \(f(x_1, x_2, \ldots x_n) = 0\) where \(n \geq 2\) and \(x_1, x_2, \ldots x_n\) are integer variables.<ref name="ref_97214d62">[https://docs.sympy.org/latest/modules/solvers/diophantine.html Diophantine — SymPy 1.7.1 documentation]</ref>
 +
# Hilbert's 10th problem asked if an algorithm existed for determining whether an arbitrary Diophantine equation has a solution.<ref name="ref_eb00bace">[https://mathworld.wolfram.com/DiophantineEquation.html Diophantine Equation -- from Wolfram MathWorld]</ref>
 +
# We exhibit a collection of (probably infinitely many) rational numbers k for which this Diophantine equation is satisfied.<ref name="ref_ab53d062">[http://ijmsi.ir/article-1-1004-en.html On the Diophantine Equation x^6+ky^3=z^6+kw^3]</ref>
 +
# Brindza, B.: On a diophantine equation connected with the Fermat equation.<ref name="ref_9700b534">[http://www.numdam.org/item/CM_1987__61_2_137_0/ Zeros of polynomials and exponential diophantine equations]</ref>
 +
===소스===
 +
<references />
 +
 +
 +
 
[[분류:디오판투스 방정식]]
 
[[분류:디오판투스 방정식]]

2020년 12월 21일 (월) 19:09 판

개요

  • 다변수다항식의 정수해 또는 유리수해를 찾는 문제를 디오판투스 방정식이라 함
  • 부정방정식으로도 불림


예


역사


메모


관련된 항목들


수학용어번역

사전 형태의 자료


리뷰, 에세이, 강의노트

  • Pannekoek, René. “Diophantus Revisited: On Rational Surfaces and K3 Surfaces in the Arithmetica.” arXiv:1509.06138 [math], September 21, 2015. http://arxiv.org/abs/1509.06138.
  • Das, Pranabesh, and Amos Turchet. “Invitation to Integral and Rational Points on Curves and Surfaces.” arXiv:1407.7750 [math], July 29, 2014. http://arxiv.org/abs/1407.7750.
  • Ono, Ken. “Ramanujan, Taxicabs, Birthdates, ZIP Codes, and Twists.” The American Mathematical Monthly 104, no. 10 (December 1997): 912. doi:10.2307/2974471.

관련도서


노트

위키데이터

말뭉치

  1. Diophantine equation, equation involving only sums, products, and powers in which all the constants are integers and the only solutions of interest are integers.[1]
  2. Congruence methods provide a useful tool in determining the number of solutions to a Diophantine equation.[1]
  3. Linear Diophantine equation in two variables takes the form of \(ax+by=c,\) where \(x, y \in \mathbb{Z}\) and a, b, c are integer constants.[2]
  4. : Solve the Homogeneous linear Diophantine equation \(6x+9y=0, x, y \in \mathbb{Z}\).[2]
  5. Use the following steps to solve a non-homogeneous linear Diophantine equation.[2]
  6. Finding the solution or solutions to a Diophantine equation is closely tied to modular arithmetic and number theory.[3]
  7. A Diophantine equation in the form is known as a linear combination.[3]
  8. The solutions to the diophantine equation correspond to lattice points that lie on the line.[3]
  9. Sometimes, modular arithmetic can be used to prove that no solutions to a given Diophantine equation exist.[3]
  10. A linear Diophantine equation is an equation of the first-degree whose solutions are restricted to integers.[4]
  11. This Diophantine equation was first studied extensively by Indian mathematician Brahmagupta around the year 628.[4]
  12. A linear Diophantine equation equates to a constant the sum of two or more monomials, each of degree one.[5]
  13. The simplest linear Diophantine equation takes the form ax + by = c, where a, b and c are given integers.[5]
  14. A homogeneous Diophantine equation is a Diophantine equation that is defined by a homogeneous polynomial.[5]
  15. If a Diophantine equation has as an additional variable or variables occurring as exponents, it is an exponential Diophantine equation.[5]
  16. We call a “Diophantine equation” to an equation of the form, \(f(x_1, x_2, \ldots x_n) = 0\) where \(n \geq 2\) and \(x_1, x_2, \ldots x_n\) are integer variables.[6]
  17. Hilbert's 10th problem asked if an algorithm existed for determining whether an arbitrary Diophantine equation has a solution.[7]
  18. We exhibit a collection of (probably infinitely many) rational numbers k for which this Diophantine equation is satisfied.[8]
  19. Brindza, B.: On a diophantine equation connected with the Fermat equation.[9]

소스

  1. ↑ 1.0 1.1 Diophantine equation | mathematics
  2. ↑ 2.0 2.1 2.2 5.1: Linear Diophantine Equations
  3. ↑ 3.0 3.1 3.2 3.3 Art of Problem Solving
  4. ↑ 4.0 4.1 Famous Diophantine Equations
  5. ↑ 5.0 5.1 5.2 5.3 Diophantine equation
  6. ↑ Diophantine — SymPy 1.7.1 documentation
  7. ↑ Diophantine Equation -- from Wolfram MathWorld
  8. ↑ On the Diophantine Equation x^6+ky^3=z^6+kw^3
  9. ↑ Zeros of polynomials and exponential diophantine equations
원본 주소 "https://wiki.mathnt.net/index.php?title=디오판투스_방정식&oldid=46443"