Sciweavers

45 search results - page 1 / 9
» Solving constrained Pell equations
Sort
View
MOC
1998
65views more  MOC 1998»
13 years 11 months ago
Solving constrained Pell equations
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...
Kiran S. Kedlaya
MOC
2010
13 years 6 months ago
On a family of Thue equations of degree 16
We consider a parameterized family of Thue equations of degree 16. By reducing this family to a system of Pell equations and linear relations, we are able to solve this family.
Volker Ziegler
MOC
2010
13 years 6 months ago
Midpoint criteria for solving Pell's equation using the nearest square continued fraction
We derive midpoint criteria for solving Pell's equation x2 -Dy2 =
Keith R. Matthews, John P. Robertson, Jim White
STOC
2002
ACM
126views Algorithms» more  STOC 2002»
14 years 11 months ago
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
Sean Hallgren
AMC
2004
86views more  AMC 2004»
13 years 11 months ago
Solving constrained matrix equations and Cramer rule
This paper presents the solution of a general constrained matrix equation using generalized inverses and gives an explicit expression for the elements of the solution matrix using...
Guorong Wang, Sanzheng Qiao