Let $p=4k+1$ be a prime number such that $p=a^2+b^2$, where $a$ is an odd integer.Prove that the equation $$x^2-py^2=a$$ has at least a solution in $\mathbb{Z}$.
Pell type equation: $x^2-py^2=a$
5
$\begingroup$
number-theory
algebraic-number-theory
-
0A standard way to find $a,b$ begins by expanding $\sqrt p$ in a continued fraction; if you stop halfway through the period of the continued fraction, somehow you get $a$ and $b$. I bet solving $x^2-py^2=a$ is related to this. Sorry I can't be more precise. – 2012-08-05
-
1$p=13$, $a=3$, $x=4$, $y=1$. – 2012-08-06
-
0@Sil, I think the idea was to prove that for *every* such $p$ there's at least one solution. – 2012-08-06
-
0@GerryMyerson, Ah, in my defence, that wasn't made very clear. – 2012-08-06