Purchase Solution

Prove that if p is a prime number of the form 4n + 1

Not what you're looking for?

Ask Custom Question

Prove that if p is a prime number of the form 4n + 1,
then the following congruence holds:

x^2 is congruent to -1 mod p.

The more detail problem is in the attached file.

Attachments
Purchase this Solution
Solution Summary

The solution explains the congruence: x^2 is congruent to -1 mod p.
The solution is given in detail.
This is mainly for solving the congruence by using the Wilson's theorem.

Solution Preview

The solution is in the attached file.

Ring Theory 3
Solving Congruences
By :- Thokchom Sarojkumar Sinha

Prove that if p is a prime number of the form 4n + 1
then the following congruence holds,

Proof :- Suppose that

Since p = 4n + 1 then p - 1 = 4n
which implies that

Therefore the product for ...

Solution provided by:
Thokchom Sarojkumar Sinha, MSc
Education
  • BSc, Manipur University
  • MSc, Kanpur University
Recent Feedback
  • "Thanks this really helped."
  • "Sorry for the delay, I was unable to be online during the holiday. The post is very helpful."
  • "Very nice thank you"
  • "Thank you a million!!! Would happen to understand any of the other tensor problems i have posted???"
  • "You are awesome. Thank you"
Purchase this Solution
Free BrainMass Quizzes
Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Probability Quiz

Some questions on probability

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

View More Free Quizzes
Related BrainMass Solutions

  • Proof of infinite primes

    3023 Proof of Infinite Positive Integers Prove: There are infinitely many prime numbers p of the form 4n+3. In other words, show that there exist infinitely many positive integers, n, such that the number 4n+1 is prime.

  • Use Euclid's proof to prove that there are infinitely many primes of the form 4n ? 1.

    50263 Infinitely Many Primes Using Euclid's Proof Prove that there are infinitely many primes of the form 4n ? 1. (Hint: Modify Euclids proof that there are infinitely many primes. First, prove that any number of the form 4n ?

  • odd prime

    Show that no prime of the form 4n + 3 can be written as a2 + b2 for some integers a and b. Show that 17 is not prime in J[i], by finding a factorization of it. Find the common greatest divisor between 3 + 4i and 4 - 3i.

  • 3, 5, and 7 are the only Prime Triplets

    if p is a prime p+2 can't be a prime. Since p+2 is divisible by 3 hence for numbers of type 3n+1, there are no prime triplets.

  • product of primes

    Recall the definition of a prime number. P is prime if it can be divided only by 1 and by itself. Consequently, if P is NOT a prime, then it can be written as a product st, with s and t both different from 1 and P. 640,000,000 is not a prime.

  • The Distribution of Quadratic Residues

    Prove ( without assuming corollary 10-1) that, if p is a prime ≡ 1 (mod 4), then there exists positive integers m, x, and y such that x^2 + y^2 =mp, with p ┼ x, p ┼ y, 0 < m < p [ Hint: use the proof of Theorem

  • The Mobius Inversion Formula

    This solution is comprised of a detailed explanation of the Mobius Inversion Formula, Primitive roots modulo p and Fermat numbers.

  • F[x]/(f(x)) is a field with p^n elements.

    f(x) is in F[x], where F is the field of integers mod p, p a prime, and f(x) is irreducible over F of degree n, prove that F[x]/(f(x)) is a field with p^n elements.

  • Discrete Math: Mathematical Induction

    Without using Theorem 4.2.2, use mathematical induction to prove that P(n): 1 + 5 + 9 + ... + (4n - 3) = n(2n - 1) for all integers n >= 1 Proof: n=1, P(1)=1=n(2n-1), so the statement is true for n=1.

View More Related Solutions