Error
There was an error loading the page.
Find the gcd d of two positive integers a and b also find integers x,y such that ax+by=d, using the extended Euclidean algorithm.
Metadata
-
England schools
-
England university
-
Scotland schools
Taxonomy: mathcentre
Taxonomy: Kind of activity
Taxonomy: Context
Contributors
Feedback
From users who are members of LSE MA103 Intro Abstract Maths :
Bernhard von Stengel
|
said | Ready to use | 8 years, 5 months ago |
History
Bernhard von Stengel 8 years, 5 months ago
Gave some feedback: Ready to use
Bernhard von Stengel 8 years, 5 months ago
Created this as a copy of Apply extended Euclidean algorithm to find gcd.| Name | Status | Author | Last Modified | |
|---|---|---|---|---|
| Apply extended Euclidean algorithm to find gcd | draft | Newcastle University Mathematics and Statistics | 20/11/2019 14:51 | |
| Apply extended Euclidean algorithm to find gcd | Ready to use | Bernhard von Stengel | 12/11/2018 15:56 | |
| Blathnaid's copy of Apply extended Euclidean algorithm to find gcd | draft | Blathnaid Sheridan | 27/02/2017 14:21 |
There are 11 other versions that do you not have access to.
| Name | Type | Generated Value |
|---|
| bsa | integer |
263
|
||||
| bsb | integer |
468
|
||||
| csa | integer |
68
|
||||
| csb | integer |
-121
|
||||
| hcf | number |
3
|
||||
| l1a | integer |
65
|
||||
| l1b | integer |
117
|
||||
| l2a | integer |
197
|
||||
| l2b | integer |
351
|
||||
| la | integer |
148
|
||||
| lb | integer |
337
|
||||
| sa | integer |
1404
|
||||
| sb | integer |
789
|
||||
| ua | integer |
189
|
||||
| ub | integer |
119
|
Generated value: integer
263
← Depends on:
This variable doesn't seem to be used anywhere.
Use this tab to check that this question works as expected.
| Part | Test | Passed? |
|---|---|---|
| Gap-fill | ||
| Hasn't run yet | ||
| Number entry | ||
| Hasn't run yet | ||
| Gap-fill | ||
| Hasn't run yet | ||
| Number entry | ||
| Hasn't run yet | ||
| Number entry | ||
| Hasn't run yet |
This question is used in the following exams: