Prime number proof

Related BrainMass Solutions

• Proof Techniques

  270490 Proof Techniques: Proof with Counterexample Proof Techniques: Homework 03 Provide counterexamples to each of the following. Every odd number is prime. Every prime number is odd. For every real number x, we have x2 > 0.

• Proof of the Irrationality using Euler's phi-function

  b) Here we know that so it is a rational number. The proof doesn't work because 4 is not prime, and its prime decomposition is 2*2. So when we run the proof and get there is no contradiction. p2 has prime factors of q2 plus 2*2 3.

• Complete Residue Systems : Suppose that p is a prime number ≥ 3. We can write 1 + 1/2 + 1/3 + 1/(p-1) = a/b with (a,b) =1. Prove that p divides a.

  Proof: From the condition, we know that is a prime and . So must be an odd prime. We also know that with .

• Explain the Proof Step-by-step : If n is not a perfect square, then n^(1/2) is irrational.

  35502 Explain the Proof Step-by-step : Irrational Function Recall that a perfect sqaure is a natural number n such that n = (k^2), for some natural number k. Theorem. If the natural number n is not a perfect square, then n^(1/2) is irrational.

• Prove that if p is a prime number p ≠ 3, then 3 divides p^2 + 2.

  164908 Prove that if p is a prime number p ≠ 3, then 3 divides p^2 + 2. College level proof before real analysis. Please give formal proof. Please explain each step of your solution. Thank you.

• Advanced Math : Let p be a poistive prime integer. Show that there is no rational number r such that p = r^2.

  57641 Advanced Math : Let p be a positive prime integer 1. Let p be a poistive prime integer. Show that there is no rational number r such that p = r^2.

• 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.

• Proofs with sets

  d) Suppose p in N(set of naturals) is a prime number. Show that every element a in Zp has a p-th root, i.e. there is b in Zp with a=bp. Please see the attachment.

• Divisors and relative primes

  First, we note that Let , d is prime > 2 (2a+1 is an odd number and hence not divisible by 2).