This document contains 5 practice questions related to number theory concepts covered in lecture 26-28. The questions ask to: 1) Prove 4 + √3 is irrational using contradiction, 2) Prove if 5n + 1 is odd then n is even using contradiction, 3) Prove if n^2 is odd then n is odd using contraposition, 4) Write the pre and post conditions of the algorithm to find the quotient and remainder of integer division, and 5) Use the Euclidean algorithm to find the GCD of 61114 and 94.
This document contains 5 practice questions related to number theory concepts covered in lecture 26-28. The questions ask to: 1) Prove 4 + √3 is irrational using contradiction, 2) Prove if 5n + 1 is odd then n is even using contradiction, 3) Prove if n^2 is odd then n is odd using contraposition, 4) Write the pre and post conditions of the algorithm to find the quotient and remainder of integer division, and 5) Use the Euclidean algorithm to find the GCD of 61114 and 94.
This document contains 5 practice questions related to number theory concepts covered in lecture 26-28. The questions ask to: 1) Prove 4 + √3 is irrational using contradiction, 2) Prove if 5n + 1 is odd then n is even using contradiction, 3) Prove if n^2 is odd then n is odd using contraposition, 4) Write the pre and post conditions of the algorithm to find the quotient and remainder of integer division, and 5) Use the Euclidean algorithm to find the GCD of 61114 and 94.
Prove by contradiction that 4 3 2 is an irrational number.
Question 2: Use contradiction to prove that if 5n 1 is odd then n is even. Question 3:
Use contraposition to prove that if n 2 is odd then n is odd.
Question 4: Write the Pre and Post Conditions of the Algorithm to find the quotient and remainder of the division of one positive integer by another. Question 5: Use Euclidean algorithm to find GCD (61114, 94).