Integer solutions of the generalized polynomial Pell equations and their finiteness: The quadratic case
Bibliographic record
Abstract
Abstract Determining the polynomials $D \in {\mathbb Z}[x]$ such that the polynomial Pell equation ${P^2-DQ^2=1}$ has nontrivial solutions $P,Q$ in ${\mathbb Q}[x]$ (and in ${\mathbb Z}[x]$ ) is an open question. In this article, we consider the generalized polynomial Pell equation $P^2-DQ^2=n$ , where $D \in {\mathbb Z}[x]$ is a monic quadratic polynomial and n is a nonzero integer. For $n=1$ , such an equation always has nontrivial solutions in ${\mathbb Q}[x]$ , but for a non-square integer n , the generalized polynomial Pell equation $P^2-DQ^2=n$ may not always have a solution in ${\mathbb Q}[x]$ . Depending on n , we determine the polynomials $D=x^2+cx+d$ , for which the equation $P^2-DQ^2=n$ has nontrivial solutions in ${\mathbb Q}[x]$ and in ${\mathbb Z}[x]$ . Taking $n=-1$ , this allows us to solve the negative polynomial Pell equation completely for any such D . An interesting feature is that there are certain polynomials D for which the generalized polynomial Pell equation has nontrivial solutions in ${\mathbb Z}[x]$ , but only finitely many, whereas the solutions in ${\mathbb Q}[x]$ are infinitely many. Finally, we determine the monic quadratic polynomials D for which the solutions of $P^2-DQ^2=n$ in ${\mathbb Z}[x]$ exhibit this finiteness phenomenon.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".