Wikipedia:Reference desk/Archives/Mathematics/2021 February 27

Mathematics desk
< February 26 << Jan | February | Mar >> Current desk >
Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


February 27

edit

A proof that there is no q such: q²=k²+1 by gaussian integers

edit

I'm trying to prove that there is no a real integer q such: q²=k²+1 via gaussian integers. I know there is a simpler proof with just decomposing it to equation of 1. But does anyone see a gaussian integer related-proof? Thanks --Exx8 (talk) 22:50, 27 February 2021 (UTC)[reply]

The question is unclear. The equation   has a solution in   when   or   Do you mean, prove that the equation   has no general solution in   for all values of  ? Then it is sufficient to give just a single counterexample, like the unsolvability of   Or does the use of "real integer" in the question mean that we should understand the variables   and   to range over  , and is your question whether the (simple) proof that this has no non-trivial solutions in   can be made complicated by involving the Gaussian integers? I have no idea what "equation of 1" means, and what the "it" is that can be decomposed to this equation. If you want us to consider your questions, you should really put more effort in formulating them clearly.  --Lambiam 07:46, 28 February 2021 (UTC)[reply]

let  . prove that :   with gauss integer properties. meaning use gauss-integer properties and theorems.--Exx8 (talk) 08:10, 28 February 2021 (UTC)[reply]

The k=0 case is still an exception so you'd have to work around that. If you add k≠0 as an assumption then it's hard to see how Gaussian integers wouldn't be making a mountain out of a molehill. If q2-k2=1 then (q-k)(q+k)=1, q-k=q+k=±1, whence q=±1, k=0. --RDBury (talk) 10:15, 28 February 2021 (UTC)[reply]

Yes of course, it is for k>=1. I know the proof for with equations. Can you see how to solve with gaussian integers?--Exx8 (talk) 12:38, 28 February 2021 (UTC)[reply]

Expounding on RDB's proof, solutions in the integers are also solution in the Gaussian integers, so the absence of solutions in the latter ring implies absence of solutions in the integers. Starting from   we see that   and   are both units and each other's conjugates, which, next to the solution   given already, only leaves   The excursion through the complex plane did not lead over a formidable mountain, but is an unhelpful detour nevertheless.  --Lambiam 12:47, 28 February 2021 (UTC)[reply]
Is there any connection to that in the complex number, we have a decomposition into to linear polynomials? I wonder if it can be somehow related to the gaussian integers...--Exx8 (talk) 13:02, 28 February 2021 (UTC)[reply]
I don't see a connection. In the ring   the polynomial   can be factored as   while the same polynomial is irreducible in    --Lambiam 15:07, 28 February 2021 (UTC)[reply]
Well is there something unique with   is there a reason which says that we cannot decompose   somehow else?--Exx8 (talk) 16:29, 28 February 2021 (UTC)[reply]
Suppose   By equating the coefficients, we have that   and   so   and therefore   This means that   This is nothing special for this polynomial: in general, the factorization of a polynomial in   into a multiset of linear factors is unique up to multiplication by a scalar (polynomial of degree 0).  --Lambiam 18:23, 28 February 2021 (UTC)[reply]