(a) Show that -163 37 Actually, the following more general result is true: -163 р -163 31 = -1. = -1 for all primes 3 < p ≤ 37, which can be proved similarly and you can use this more general result in part (b) without proving for the remaining values of p. (b) Let p(n) = n² +n + 41. Using part (a), prove that p(0), p(1), p(2),,p(39) are all primes.

Q: 2. Use a fixed-point iteration method to determine a solution accurate to within 0.01 and x0=1 g (x)…

A:

Q: ve that the only perfect number of the form n = p²q where p and q are distinct primes is 28.

A:

Q: how that in the domain of integers of the form a+bsqrt(-17) the factorization…

A: The  objective is to show that 13 is irreducible. The norm of 13 is 13=132=169 So if 13 is reducible…

Q: True or false: If p is an odd prime, then (p-1)! + 2^(p-1) congruent 0(mod p). Justify your answer.

A: p is an odd prime.

Q: [1+6n A" 7 4 4n -9 -5 -9n 1-6n | If , show that for every n natural number.

A:

Q: n² + n+ 8 2 He has just shown you a convincing proof that if the equation is true for any integer k…

A:

Q: 2(5) – 3(1 – 6) 1. Is even integer? 5 2. List all even integers between -6 and 6. 3. Is 124/6…

A: Four questions are given. The solution to the four questions are given below.

Q: 1). x dy dy xe ty

A:

Q: Is it true that (3 x EN) (x²-3x +20 is a prime)? O True False

A: Is it true that ( there exists x in N)(x^2-3x+20  is a prime ) ?   True False

Q: prove

A: Here we use, 3+3=9 and 6+3=9 We have to prove,3×3=9 by peano's axiom for natural number.

Q: For the first 5 odd primes, show that Wilsn's theorem holds to be true.

A:

Q: primes

A:

Q: (i) Prove that if p is a prime, then (p - 1)! = -1 (mod p). (ii ) Show that 18! = -1 (mod 437).

A:

Q: Identify the error in the following proof:“ If n amd m are two different odd integers then there…

A:

Q: For the following proof, determine which of the statements given below is being proved. Proof.…

A: Contrapositive: The contrapositive of the statement, " If P, then Q" is " If not Q, then not P".

Q: (a) Show that, for any odd prime p > 5, 1 if p = 1, –5 (mod 12) (주) -1 if p= -1,5 (mod 12)

A:

Q: Every even integer greater than 2 is sum of two primes? Give your views on this?

A: We know that 2 is even prime. And all other primes are odd.

Q: 6) Let n be a positive integer such that 7 | (52n-1 +22n-1). Prove that 7 || (52n+1+22n+¹). (Hint:…

A: Since, given that  52n-1+ 22n-1  is divisible by 7 .  We have to prove that  52n+1+22n+1 is also…

Q: Find a primitive third root of unity e F7, then verify by direct computation that (5 - 5)? = -3 in…

A: Primitive roots are those x which satisfy x^k = 1 mod n

Q: rove that if p and q are distinct odd p CT (p-1)(q-1) = (-1) 4 uadratic reciprocity law.

A:

Q: Prove or disprove: There exists an integer a such that 14 | (3a – 5) and 21 | (2a +3).

A:

Q: Theorem: The number of diagonals of a regular n- Define P (n) = n(n-3) 2 gon is n(n − 3) 2 - for n ≥…

A:

Q: alculate (a) ?500 (2i + 5). i=0 (b) the sum of the first 50 multiples of 3 (starting from 3, not…

A: Given 500 (2i + 5).for i=0

Q: (g) 111... 111 (126 ones) (2) Prove that the numbers given in each part cannot be prime…

A:

Q: Prove that if n is an integer and 5n + 6 is even, then n is even.

A:

Q: Every even integer greater than 2 is sum of two primes? Give your views on this?

A:

Q: Prove that 3 | 22n+1 +1 for all natural numbers n.

A: Note: Since you have asked multiple questions, we will solve the first question for you. If you want…

Q: Prove that 1 + 3 + 5 +···+ (2n − 1) = n2 for every positive integer n (a) by adding 1 + 3 + 5 +···+…

A:

Q: 3. Prove that any Integens . Proof (by contradicton): ,9 t (a?-3)

A:

Q: For integer values of a, use a proof by contraposition (also called contrapositive or indirect…

A:

Q: 2. For each of the following, use a counterexample to prove the statement is false. * (a) For each…

A:

Q: 1. Let a and b be natural numbers, where a, b > 2, such that gcd(a, b) = 1 and ab = (x + y)" for…

A: