ผลต่างระหว่างรุ่นของ "01204211/activity7 number theory 2"
ไปยังการนำทาง
ไปยังการค้นหา
Jittat (คุย | มีส่วนร่วม) |
Jittat (คุย | มีส่วนร่วม) |
||
แถว 3: | แถว 3: | ||
== In-class activities == | == In-class activities == | ||
− | '''A.1''' Implement the Extended-GCD algorithm and use it to find | + | '''A.1''' Implement the Extended-GCD algorithm and use it to find, for each following pair of <math>a</math> and <math>b</math>, the g.c.d. of <math>a</math> and <math>b</math> and a pair of integers <math>(x,y)</math> such that <math>ax + by = gcd(a,b)</math>. |
− | (a) | + | (a) <math>a = 5, b = 7</math> |
+ | |||
+ | (b) <math>a = 500, b = 7123</math> | ||
+ | |||
+ | (c) <math>a = 55515, b = 71234</math> | ||
+ | |||
+ | (d) <math>a = 5551532, b = 7123456</math> | ||
+ | |||
+ | (e) <math>a = </math>your student id, <math>b = </math> the student id of another student sitting next to you. | ||
== Homework == | == Homework == |
รุ่นแก้ไขเมื่อ 16:29, 14 ตุลาคม 2558
- This is part of 01204211-58.
In-class activities
A.1 Implement the Extended-GCD algorithm and use it to find, for each following pair of and , the g.c.d. of and and a pair of integers such that .
(a)
(b)
(c)
(d)
(e) your student id, the student id of another student sitting next to you.