Greatest common divisors.

Related BrainMass Solutions

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

• Greatest Common Divisors

  Common Divisors are investigated.

• Complex Numbers : Find Greatest Common Divisor ( GCD ) using the Euclidean Algorithm

  This means that there are no irreducible common divisors of 85 and 1+13i. A greatest common divisor is found using the Euclidean algorithm.

• Algorithm to generate an increasing sequence of integers

  Then, there is a greatest number x (whose only prime divisors are 2 and 3) such that x = 2^i * 3^j.

• Greatest common divisor

  common divisors.

• Common Divisors

  58444 Common Divisors 1. Let d; a; b; r, and q be integers. a) Suppose that d|a and d|b. Show that d|(ra + qb). b) Suppose a = qb + r. Show that the set of common divisors of a and b is the set of common divisors of b and r.

• Discrete Mathematics : Integer Algorithms, GCD, Solving Congruences and Diagonal Matrices

  What is the greatest common divisors of these pairs of integers? a) 22 * 33 * 55, 25 * 33 * 52 b) 2 * 3 * 5 * 7 * 11 * 13, 211 * 39 * 11 * 1714 c) 17, 1717 d) 22 * 7, 53 * 13 e) 0, 5 f) 2 * 3 * 5 * 7, 2 * 3 * 5 * 7 Number Theory 18.

• Find d=GCD(a,b) and integers x and y such that d=ax+by....

  Greaest common divisors are found. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.

• Solving equations using the rational root theorem

  This has divisors of the form s * 2^a * 3^b * 5^c where s is a sign, and a is between 0 and 4, b is between 0 and 3 and c is between 0 and 2. This means that there are 2*5*4*3 = 120 possible divisors to check out.