Proving Irreducibility of Primes in Z[√-5]

  • Thread starter jaqueh
  • Start date
  • Tags
    Primes
In summary, the statement given is that if p is a prime number, it is irreducible in Z[√−5] if and only if there does not exist α ∈ Z[√−5] such that N(α) = p. Using this, the smallest prime number that is not irreducible in Z[√−5] can be found by finding a product of two numbers in Z[√−5] whose norms equal the given prime.
  • #1
jaqueh
57
0

Homework Statement


Suppose p is a prime number. Prove that p is irreducible in Z[√−5] if and only if there does not exist α ∈ Z[√−5] such that N(α) = p.
Using this, find the smallest prime number that is not irreducible in Z[√−5].

Homework Equations


α = a+b√−5 ∈ Z[√−5]
N(α) = a2 + 5b2
N(α)N(β) = N(αβ)

The Attempt at a Solution


I did => so I'm now doing <=

(Contraposition)Suppose that p is reducible in Z√-5 and isn't prime, then we know that p can be a product of two numbers: call them x,y ∈ Z√-5. Then we get that N(P)=n(x,y)=n(x)n(y)=(a2+5b2)(c2+5d2)

then i have no idea what to do
 
Physics news on Phys.org
  • #2
You seem to be confused as to what "<=" is. The fact that p is prime is a given for either direction. You can't say "Suppose p isn't prime". The converse is "If there does not exist [itex]a\in Z[\sqrt{-5}][/itex] such that N(a)= p, then p is irreducible in [itex]Z[\sqrt{-5}][/itex]."
 

1. What is the definition of irreducibility of primes in Z[√-5]?

Irreducibility of primes in Z[√-5] means that a prime number cannot be factored into smaller numbers in the ring Z[√-5]. In other words, it cannot be broken down into two non-unit elements.

2. Why is proving irreducibility of primes in Z[√-5] important?

Proving irreducibility of primes in Z[√-5] is important because it helps in understanding the structure and properties of the ring Z[√-5]. It also has applications in number theory and algebraic geometry.

3. How is the irreducibility of primes in Z[√-5] proved?

The irreducibility of primes in Z[√-5] can be proved using a variety of methods, such as the Eisenstein criterion, Gaussian integers, or modular arithmetic. Each method has its own set of conditions and limitations, and the most suitable method may vary depending on the specific prime number being tested.

4. Can all prime numbers in Z[√-5] be proven to be irreducible?

No, not all prime numbers in Z[√-5] can be proven to be irreducible. For example, the prime number 2 can be factored as (1+√-5)(1-√-5), which are both non-units in the ring. However, this does not mean that all prime numbers in Z[√-5] are reducible. It is possible to prove irreducibility for a majority of prime numbers in the ring.

5. Are there any ongoing research or open questions related to proving irreducibility of primes in Z[√-5]?

Yes, there is ongoing research in this area, particularly in finding new methods or improving existing methods for proving irreducibility. There are also open questions regarding the generalization of these methods to other rings and fields. Additionally, there are still some prime numbers in Z[√-5] that have not been proven to be irreducible, leaving room for further exploration and discovery.

Similar threads

  • Calculus and Beyond Homework Help
Replies
15
Views
3K
  • Calculus and Beyond Homework Help
Replies
4
Views
889
  • Calculus and Beyond Homework Help
Replies
2
Views
2K
  • Calculus and Beyond Homework Help
Replies
13
Views
2K
  • Calculus and Beyond Homework Help
Replies
3
Views
739
  • Calculus and Beyond Homework Help
Replies
5
Views
1K
  • Calculus and Beyond Homework Help
Replies
15
Views
2K
  • Calculus and Beyond Homework Help
Replies
2
Views
270
  • Calculus and Beyond Homework Help
Replies
3
Views
550
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
Back
Top