This image has been resized. Click here to view the original image.
Always view original.
Don't show this message.
Search
(Supports wildcard *)Tags
Copyright
- the embodiment of scarlet devil 7075
- touhou 652361
Character
- flandre scarlet 39386
- koakuma 10464
- patchouli knowledge 24861
Artist
- fujii tatsuya 36
General
- 3girls 103807
- blonde hair 833996
- blush stickers 57875
- chibi 153265
- fang 157002
- hair ribbon 325061
- hat 734830
- head wings 28194
- highres 2396528
- long hair 2089229
- math 439
- multiple girls 280049
- necktie 258206
- purple eyes 409746
- purple hair 310293
- red eyes 688706
- red hair 282943
- redhead 27841
- ribbon 607989
- stick 3886
- teaching 178
- text 14817
- violet eyes 20303
- wall of text 275
- wings 238555
Meta
- partially translated 4391
- translation request 371886
Statistics
- Id: 736781
- Posted: 2011-12-14 08:55:50
by danbooru - Size: 1296x1812
- Source: img63.pixiv.net/img/laevateinn495/17211423_big_p0.jpg
- Rating: Safe
- Score: 0 (vote up/down)
Number 3 is actually a difficult question, so be careful!
Let's practice! [Question] Apply the Euclidean Algorithm to solve the following:
Theorem 3.1 is actually the Euclidean Algorithm. For example, to get (361, 133), 361=133x2+95, therefore (361,133)=(95,133). Similarly, 133=95+38 therefore (95,133)=(95,38), and 95=38x2+19 implies that (95,38)=(19,38)=19, therefore (361,133)=19.
[Theorem 3.1] (a, b) = (a-qb, b) for any integer q. [Proof] Let the GCD of a and b be g. From that, g divides a-qb for any q. Because g is the GCD of a and b, therefore from Theorem 2.1, g is a divisor of (a-qb, b), and therefore g <= (a-qb, b) Let a' = a-qb. Therefore, a = a' + qb, and (a', b) is a divisor of (a, b). Therefore, (a', b) <= g. Combine the two inequalities, and we have (a', b) = g = (a, b), Q.E.D.
Euclidean algorithm
<a href="http://en.wikipedia.org/wiki/Euclidean_algorithm">Euclidean algorithm</a>
Edit | Respond
comment (0 hidden)