This is not a ready-to-download math worksheet. It is a template, that is a preconfgured list of problems with parameters, that you can use to create your own math worksheet from. You can then change the resulting worksheet if some of the parameters need any tweaking. To use this template and create your own custom worksheet, you have to register first so you can edit worksheets. You can register and create an account in a minute - there is a free trial available. Register here, and you can use this template. There is no charge for joining and as a new member, you will get a free amount of starting credits. After registering, please choose the tab "My worksheets", then select "View templates".
Two ways to determine the gcd of two numbers.
The worksheets deals with two ways to determine the greatest common divisor: Comparing the set of divisors of two numbers, and the Euclidean Algorithm. The first task requires the creation of a list of divisors for each number. The gcd can then be determined by finding the greatest number that appears in both lists. The second task requires the application of the Euclidean Algorithm. The Euclidean Algorithm is presented and explained for the first set of two numbers. The execution of the algorithm for four more subsequent number pairs is left to the reader.
This is what the worksheet will look like. On the left hand side, the problem type is shown with its quickname. On the right, you will see a preview of the problem. This is just a sample, as dw-math will generate a new one when you load the template. Click on the underlined problem name to jump to the problem's detail page. You can download preview worksheets and solution sheets for this problem there. Note that all problem numbers are show as one here, in the worksheet they will be numbered sequentially. The worksheet's header and footer are not shown here.
|Determine gcd and lcm by comparing multiples & divisors|
For two given numbers, the gcd and lcm are determined by comparing lists of multiples or divisorsQuickname: 4978
|GCD computation with the Euclidean Algorithm|
Compute the GCD step by step with the Euclidian Algorithm.Quickname: 2001
Cookies are small data snippets that we store on your computer to recognize you when you use our website.
There are cookies that we need for technical reasons to make the website usable for you. You cannot deactivate these, because otherwise our website would not work.
Technically necessary cookies
Cookies for tracking activity and displaying personalized ads