Danbooru
Login Posts Comments Notes Artists Tags Pools Wiki Forum More »
Listing Upload Hot Changes Help

Search

  • Help
guro
scat
furry -rating:g

Artist

  • ? azel (laevateinn495) 193

Copyright

  • ? touhou 1.0M

Characters

  • ? flandre scarlet 59k
  • ? koakuma 15k
  • ? patchouli knowledge 37k

General

  • ? 3girls 309k
  • ? blonde hair 2.0M
  • ? blush stickers 146k
  • ? chibi 348k
  • ? educational 217
  • ? fang 425k
  • ? hair ribbon 757k
  • ? hat 1.6M
  • ? head wings 87k
  • ? long hair 5.8M
  • ? math 1.4k
  • ? multiple girls 2.0M
  • ? necktie 615k
  • ? purple eyes 1.1M
  • ? purple hair 860k
  • ? red eyes 1.7M
  • ? red hair 691k
  • ? ribbon 1.4M
  • ? stick 8.4k
  • ? teaching 501
  • ? text focus 19k
  • ? wall of text 1.6k
  • ? wings 581k

Meta

  • ? bad id 1.4M
  • ? ↳ bad pixiv id 1.1M
  • ? commentary request 5.9M
  • ? highres 7.5M
  • ? photoshop (medium) 709k
  • ? translated 632k

Information

  • ID: 1053537
  • Uploader: henmere »
  • Date: over 14 years ago
  • Size: 411 KB .jpg (1296x1812) »
  • Source: pixiv.net/artworks/17211423 »
  • Rating: Sensitive
  • Score: 0
  • Favorites: 7
  • Status: Deleted

Options

  • Resize to window
  • View smaller
  • View original
  • Find similar
  • Download

History

  • Tags
  • Pools
  • Notes
  • Moderation
  • Commentary

This post was deleted for the following reason:

Unapproved in three days (over 14 years ago)
Resized to 65% of original (view original)
flandre scarlet, patchouli knowledge, and koakuma (touhou) drawn by azel_(laevateinn495)

Artist's commentary

  • Original
  • 例大祭新刊サンプル

    例大祭8新刊のサンプルです。
    表紙:pixiv #17173120 »
    中身は、東方のキャラクターが大真面目に解説をしている数学書です。
    誰得なのは気にしない方向で。

    • ‹ prev Search: status:any next ›
    • « ‹ prev Pool: Touhou - Tutoring Flan-chan ~Elementary Number Theory~ (Fujii Tatsuya) next › »
  • Comments
  • Recommended
  • Loading...

    RaymooHakurei
    over 14 years ago
    [hidden]

    For the translators of this pool.... I wish you all the luck against a huge wall_of_text

    0 Reply
    • Copy ID
    • Copy Link
    dkellis
    over 14 years ago
    [hidden]

    Of the things I would have expected under "Elementary Number Theory", Euclid's algorithm is not one of them.

    0 Reply
    • Copy ID
    • Copy Link
    Astrojensen
    over 14 years ago
    [hidden]

    God, I wish my math textbooks looked like this when I went to school.

    0 Reply
    • Copy ID
    • Copy Link
    underscoreCF
    over 14 years ago
    [hidden]

    I guess the joke is that this is like several kinds of advanced mathematics together.

    0 Reply
    • Copy ID
    • Copy Link
    Shadowflames
    over 14 years ago
    [hidden]

    Hoo, didn't expect to see a proof of Euclidean Algorithm on Danbooru. I tried my best to remember how the proof is done, but it's been a while. If there's any mistakes, please correct!

    1 Reply
    • Copy ID
    • Copy Link
    zephyredx
    over 14 years ago
    [hidden]

    ...brb asking my number theory teacher to use this as a textbook...

    0 Reply
    • Copy ID
    • Copy Link
    Lord Enki
    over 14 years ago
    [hidden]

    EDUCATION ON DANBOORU.

    SURPRISING, BUT PLEASANT.

    too bad we got a hole in the translation.

    0 Reply
    • Copy ID
    • Copy Link
    Shadowflames
    over 14 years ago
    [hidden]

    Hole fixed. The lack of punctuation in that box really impeded the understanding.

    Remember, kids, punctuation is your friend!

    0 Reply
    • Copy ID
    • Copy Link

    Leave a comment

    [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.
    In the previous chapter, we have shown how to obtain the Greatest Common Divisor of two numbers. For small numbers, that method was effective; but for large numbers, the method became unwieldy. However, with the method I'm about to introduce, we could get the Greatest Common Divisor of two very large numbers very easily. First, let's examine the following theorem.
    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.
    Number 3 is actually a difficult question, so be careful!
    Euclidean algorithm
    Euclidean algorithm
    Let's practice! [Question] Apply the Euclidean Algorithm to solve the following:
    Terms / Privacy / Upgrade / Contact /