Compute the GCD step by step with the Euclidian Algorithm.
The tasks is to perform a detailed calculation of the largest common divisor (GCD) of two whole numbers with the Euclidean algorithm. The number space from which the numbers are chosen is adjustable. Also the number of problens can be selected.
To perform the computation, the following steps are repeated in rounds according to the algorithm.
1. Determine the quotient and remainder of the larger and the smaller number.
2- If the remainder is zero, the GCD has been determined. It is the last quotient.
3. Select the divisor of this round as the dividend for the next round. The divisor for the next round will be the remainder of this round.
4. Repeat from step one with the new dividend and divisor.
The first problem can be configured as a sample problem, which will be presented with the solution.
Download free worksheets for this math problem here. The worksheet contains the problems only, the solutions sheet includes the answers. Just click on the respective link.
If you can not see the solution sheets for download, they may be filtered out by an ad blocker that you may have installed. If this is the case, please allow ads for this page and reload the page. The solution sheets will then reappear.
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