Proofs : GCDs and Primes
Not what you're looking for?
1. (i) Find the gcd (210, 48) using factorizations into primes
(ii)Find (1234, 5678)
2. Prove that there are no integers x, y, and z such that
x^2 + y^2 + z^2 = 999
keywords: greatest comon divisor
Purchase this Solution
Solution Summary
Proofs involving GCDs and Primes are provided. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.
Solution Preview
Problem #1
(i) We use factorizations.
210 = 2*3*5*7
48 = 2*2*2*2*3
Thus gcd(210,48)=2*3=6
(2) To find gcd(1234,5678), we can use the Eucliean algorithm.
5678 = 4*1234 + 742
1234 = 1*742 + 492
742 = 1*492 + ...
Purchase this Solution
Free BrainMass Quizzes
Geometry - Real Life Application Problems
Understanding of how geometry applies to in real-world contexts
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
Graphs and Functions
This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.
Exponential Expressions
In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.