Questions tagged [gaussian-integers]

This tag is for questions relating to the Gaussian integer, which is a complex number $~z=~a~+i~b~$ whose real part $~a~$ and imaginary part $~b~$ are both integers.

In number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as $\mathbb {Z}[i]$. This integral domain is a particular case of a commutative ring of quadratic integers. It does not have a total ordering that respects arithmetic.

Formally, Gaussian integers are the set

$$\mathbb {Z}[~i~]=\{~a~+i~b~|~a,~b~\in \mathbb {Z}\} \qquad \text{where$~i=\sqrt{-1}$}$$

  • In particular, since either or both of $~x~$ and $~y~$ are allowed to be $~0~$, every ordinary integer is also a Gaussian integer.

  • When considered within the complex plane, the Gaussian integers constitute the $~2-$dimensional integer lattice.

  • The conjugate of a Gaussian integer $~a~ +~ i~b~$ is the Gaussian integer $~a~ -~ i~b~$.

  • Gaussian integers can be uniquely factored in terms of other Gaussian integers (known as Gaussian primes) up to powers of $~i~$ and rearrangements.

295 questions
79
votes
7 answers

Quotient ring of Gaussian integers

A very basic ring theory question, which I am not able to solve. How does one show that $\mathbb{Z}[i]/(3-i) \cong \mathbb{Z}/10\mathbb{Z}$. Extending the result: $\mathbb{Z}[i]/(a-ib) \cong \mathbb{Z}/(a^{2}+b^{2})\mathbb{Z}$, if $a,b$ are…
50
votes
3 answers

Any odd number is of form $a+b$ where $a^2+b^2$ is prime

This conjecture is tested for all odd natural numbers less than $10^8$: If $n>1$ is an odd natural number, then there are natural numbers $a,b$ such that $n=a+b$ and $a^2+b^2\in\mathbb P$. $\mathbb P$ is the set of prime numbers. I wish help…
38
votes
6 answers

Prove that the Gaussian Integer's ring is a Euclidean domain

I'm having some trouble proving that the Gaussian Integer's ring ($\mathbb{Z}[ i ]$) is an Euclidean domain. Here is what i've got so far. To be a Euclidean domain means that there is a defined application (often called norm) that verifies this two…
23
votes
1 answer

How much of an infinite board can a N-mover reach?

This question is inspired by the question on codegolf.SE: N-movers: How much of the infinite board can I reach? A N-mover is a knight-like piece that can move to any square that has a Euclidean distance of $\sqrt{N}$ from its current square. That…
22
votes
3 answers

Can $\operatorname{Re}(a+bi)^{n}$ be overlapped with $a,b\in\mathbb{Z}$ fixed?

Is there any integer solution for $$\operatorname{Re}((a+bi)^{m})=\operatorname{Re}((a+bi)^{n})$$ except $(m,n)=(0,1),(1,3)$, where $0\leq m
21
votes
3 answers

Where is wrong with this fake proof that Gaussian integer is a field?

The Gaussian integer $\mathbb{Z}[i]$ is an Euclidean domain that is not a field, since there is no inverse of $2$. So, where is wrong with the following proof? Fake proof First, note that $\mathbb{Z}[X]$ is a integral domain. Since $x^2+1$ is an…
Math.StackExchange
  • 3,544
  • 14
  • 28
17
votes
1 answer

Quotient ring of Gaussian integers $\mathbb{Z}[i]/(a+bi)$ when $a$ and $b$ are NOT coprime

The isomorphism $\mathbb{Z}[i]/(a+bi) \cong \Bbb Z/(a^2+b^2)\Bbb Z$ is well-known, when the integers $a$ and $b$ are coprime. But what happens when they are not coprime, say $(a,b)=d>1$? — For instance if $p$ is prime (which is not coprime with…
16
votes
3 answers

Units of Gaussian integers

How can we show that $\pm 1, \pm i$ are the only units in the ring of Gaussian integers, $\mathbb Z[i]$? Thank you.
gaussian
  • 171
  • 1
  • 1
  • 4
14
votes
4 answers

Solve in $\mathbb{Z}$ the equation $x^4 + 1 = 2y^2$.

Find all pairs of intergers $(x,y)$ such that $x^4 + 1 = 2y^2$. I'm thinking of Gaussian integers, since the LHS can be factored in $\mathbb{C}$. But I don't know how to continue here.
11
votes
3 answers

A few questions on the Gaussian integers

I have a few questions surrounding the Gaussian integers, which I hope can be answered together in one fell swoop. The Gaussian integers are defined as $\mathbb{Z}[i] = \{x + iy : x, y \in \mathbb{Z}\}$. What is the intuition for working with them,…
9
votes
1 answer

How to generate similar identities to $(5+i)^4=2(1+i)(239+i)$

Introduction: The Machin formula$$\frac \pi4=4\arctan\frac 15-\arctan\frac 1{239}\tag1$$Can be derived from the tangent angle formula. But $(1)$ can also be derived from the identity involving complex numbers$$(5+i)^4=2(1+i)(239+i)\tag{2}$$And…
Crescendo
  • 3,974
  • 1
  • 12
  • 34
9
votes
1 answer

What is known about the counting function of Gaussian primes"

The counting function of primes among $\Bbb{N}$, describing the asymptotic density of the primes, is well known (the Prime Number theorem). Let's define a mild generalization of the counting function concept: Given sets $S$ and $P\subset S$, and a…
Mark Fischler
  • 40,850
  • 2
  • 36
  • 70
8
votes
0 answers

Fermat's Last Theorem ($n=4$) using the Gaussian integers

I'm doing the second part of the following exercise in Miles Reid's Undergraduate Commutative Algebra: Exercise 0.18: Prove the cases $n=3$ and $n=4$ of Fermat's last theorem. I would like to know: Is my proof correct? Is there a simpler way to…
8
votes
0 answers

Closed form bijection between integers and pairs thereof

I know that it's simple enough to map the integers, $\mathbb{Z}$, to pairs of integers, $\mathbb{Z}^2$, in a bijective way (i.e. a one-to-one mapping). You can wrap the integers around the origin of the 2D Cartesian grid like a spiral, or you can…
8
votes
2 answers

Gaussian prime factorization.

I have a hard time on factorizing elements from $\mathbb{Z}[i]$, especially $-19+43i$. I know that the primes in $\mathbb{Z}[i]$ are: $1+i$. $p$ from $\mathbb{N}$, $p=4k+3$ , $k$ integer ( $p\equiv 3\pmod{4}$ ). $a+bi$ from $\mathbb{Z}[i]$,…
1
2 3
19 20