Euclid's Algorithm

Hvordan kan vi hjælpe?

Howard Bradley

23. april 2017 11:20

Could you do a video explaining Euclid's Algorithm (for finding the GCD (GCF) of two integers). With a couple of worked examples.

A question that comes up fairly often in the discussions section is "Is there a way to find the GCF without just listing all the factors? What if there are a lot of factors?" Or words to that effect.

To which the answer is something along the lines of "Just list all the factors, you'll get the hang of it with practice." Probably true (for small numbers), but not very mathematical.

I've looked on-line for videos, and they certainly exist, but they all seem a bit rushed. I'm sure Sal's patient, clear delivery would be a great improvement.

Nyt opslag

3 kommentarer

Katey Gordon

23. april 2017 11:28
0

Kommentarhandlinger Permalink
Hi Howard ,
Have you seen this article written in Khan Academy about Euclid's Algorithm?
https://www.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm

It may explain some of your questions in the topic your looking .Also should you have any further questions I will be happy to answer them for you.
Proud to be a Khan Academer
Katrina
Redapple8787

23. april 2017 18:35
0

Kommentarhandlinger Permalink
I found an article about Euclid's Algorithm, but I think it would be better if it was either condensed, done into a video, or inserted into the Pre-algebra section for Factors and Multiples. I believe it would be easier if all three were done or the article was made into a video and put into the math section.

Apple Wu
Inger Hohler

24. april 2017 19:48
0

Kommentarhandlinger Permalink
Redapple, is the article you are thinking about this one? If so it's not really integrated with the math section, it's part of the Computer algorithm theme. The Computer algorithm theme is meant for older students than the https://www.khanacademy.org/math/pre-algebra/pre-algebra-factors-multiples/pre-algebra-greatest-common-divisor/v/greatest-common-divisor video.

However, for students who are interested in alternative methods, the discussion under the video mentions both Euclid's Algorithm and the fraction method mentioned by Byron Lawson could be of interest.

Opslag er lukket for kommentarer.

Euclid's Algorithm

Fandt du ikke det, du ledte efter?

3 kommentarer

Fandt du ikke det, du ledte efter?