Fun with Integers

/in /by

Fun with Integers

  1. Find the GCD (greatest common divisor) of the numbers 1350 and 297 using the Euclidean Algorithm. State the GCD, d, in terms of d = sa + tb. Show your work.
    [Hint: if you are stuck use www. wolframalpha.com to find the answer, then show your work.] In your response posts, compare the method that you used to that of your classmates. Did they make a mistake somewhere (or perhaps you did)?
  2. Write the base 8 expansion of the number 486. Show your work
  3. Write the base 10 expansion of the following base 2 number: 1011011