The Polynomial t2(4x − n)2 − 2ntx Does Not Always Admits a Perfect Square
preprint
OA: closed
Abstract
In this article we show that the polynomial \( t^2(4x - n)^2 - 2ntx \) does not always admits a perfect square with \( n\geq 2 \) and \( (x,t)\in \mathbb{(N^*)^2} \). We prove this when \( n=3 \) and we show by contradiction that one of x or t (in the expression \( t^2(4x - 3)^2 - 6tx \)) isn't an integer.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.
Source provenance
- europepmc
- last seen: 2026-05-20T01:45:00.602351+00:00