2009 SQA Advanced Higher Maths no.10 Euclidian algorithm

1,058 views · Published 29 January 2013 · 3:30 · Indexed 25 September 2026

Channel: DLBmaths · 2013 · Education

Watch on YouTube

Using the Euclidian algorithm to find the greatest common divisor of two numbers.
Using the algorithm to find a solution to the Diophantine equation equal to that gcd.

Instructional exercise consisting of question 10 from
the 2009 SQA Advanced Higher Mathematics exam.
Set out in stages of 'try then check' the worked solution to each part of the question.

More from this channel

• 15:23 Long Division

  DLBmaths

  856 views · 18 March 2012

• 6:04 Advanced Higher Maths proof by induction - matrix

  DLBmaths

  4,768 views · 19 March 2012

• 7:39 Advanced Higher Maths proof by induction 1 24.mov

  DLBmaths

  688 views · 20 March 2012

• 10:44 Multivariable Calculus: Speed Revision 1 - partial derivatives

  DLBmaths

  1,329 views · 8 April 2012

• 13:48 Advanced Higher Maths: integrating quadratic denominators (part 1)

  DLBmaths

  4,391 views · 10 April 2012

• 11:30 1997 SQA Higher Maths paper 2: 8 & 9

  DLBmaths

  1,171 views · 25 April 2012

• 6:25 2002 SQA Higher Maths: Circles and Logs

  DLBmaths

  3,604 views · 16 May 2012

• 2:59 2012 SQA Advanced Higher Maths: 6 (Maclaurin expansion)

  DLBmaths

  3,199 views · 22 May 2012