Purchase Solution

Computing greatest common divisor and least common multiple

Not what you're looking for?

Ask Custom Question

1. Each row in the following table contains values for the integers a and b. In this table, the value of r is the remainder (from the Division Algorithm) when a is divided by b. Complete each row in this table by determining gcd(a, b), r, and gcd(b, r).

a b gcd(a, b) Remainder r gcd(b, r)
44 12
75 21
50 33

2. Formulate a conjecture based on the results of the table in Part (1).

3. Find two rational numbers with denominators 9 and 15, respectively, whose sum is equal to 10/225 or explain why it is not possible to do so.

Purchase this Solution
Solution Summary

The solution gives detailed steps on computing a greatest common divisor and a least common multiple. This solution is 218 words and includes calculations.

Solution Preview

1. Each row in the following table contains values for the integers a and b. In this table, the value of r is the remainder (from the Division Algorithm) when a is divided by b. Complete each row in this table by determining gcd(a, b), r, and gcd(b, r).

a b gcd(a, b) Remainder r gcd(b, r)
44 12 4 8 ...

Purchase this Solution
Free BrainMass Quizzes
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.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Graphs and Functions

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

Probability Quiz

Some questions on probability

View More Free Quizzes
Related BrainMass Solutions

  • Euclidean Rings and GCD

    , where is the greatest common divisor of and .

  • Unique Factorization Prime/Co-Prime

    Now let's think about this: suppose there exists a prime that divides both a and b, then p is a common divisor of a,b. gcd(a,b) is the greatest common divisor, so certainly we have gcd(a,b)>=p.

  • Discrete Mathematics and its Applications : Greatest Common Divisors

    56004 Discrete Mathematics and its Applications : Greatest Common Divisors A) Define the greatest common divisor of two integers. b) Describe at least three different ways to find the greatest common divisor of two integers.

  • Ring Theory : Associate of a Greatest Common Divisor and Euclidean Rings

    105221 Associate of a Greatest Common Divisor and Euclidean Rings In a Euclidean ring R, any associate of a greatest common divisor is a greatest common divisor. keywords: GCD, GCDs Please see the attached file for the complete solution.

  • Ring Theory: Greatest Common Divisor (GCD)

    111047 Ring Theory: Greatest Common Divisor (GCD) Please respond to the following question: Find the greatest common divisor of the following polynomials over F, the field of rational numbers: x^3 - 6x^2 + x + 4 and x^5 - 6x + 1 Please see the attached

  • Greatest Common Divisor in Java

    239119 Greatest Common Divisor in Java I have to write an interactive program that will find the Greatest common divisor between two inputted integers.

  • Euclidean algorithm

    49616 Greatest common divisor Find the greatest common divisor of a) 705 and 1962 b) 5339 and 2565 Please see the attached file. This shows how to find the greatest common divisor using the Euclidean algorithm.

  • Greatest common divisor

    Hence the result.// This is a proof regarding greatest common divisor.

  • divisibility

    This solution is comprised of a detailed explanation to find the greatest common divisor of the following pairs, find the gcd, and find the integers.

View More Related Solutions