Euclid's Algorithm
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.
Post ist für Kommentare geschlossen.