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

Search

Blacklisted (help)

  • guro
  • scat
  • furry -rating:g
Disable all Re-enable all

Artist

  • ? azel (laevateinn495) 168

Copyright

  • ? touhou 939k

Characters

  • ? flandre scarlet 54k
  • ? koakuma 15k
  • ? patchouli knowledge 35k

General

  • ? 3girls 265k
  • ? blonde hair 1.7M
  • ? blush stickers 116k
  • ? chibi 274k
  • ? educational 190
  • ? fang 357k
  • ? hair ribbon 657k
  • ? hat 1.3M
  • ? head wings 71k
  • ? long hair 4.8M
  • ? math 1.2k
  • ? multiple girls 1.7M
  • ? necktie 501k
  • ? purple eyes 906k
  • ? purple hair 719k
  • ? red eyes 1.4M
  • ? red hair 584k
  • ? ribbon 1.2M
  • ? stick 7.0k
  • ? teaching 390
  • ? text focus 18k
  • ? wings 479k

Meta

  • ? bad id 1.3M
  • ? ↳ bad pixiv id 981k
  • ? commentary request 3.6M
  • ? highres 6.0M
  • ? photoshop (medium) 707k
  • ? translation request 611k
  • ? ↳ partially translated 20k

Information

  • ID: 1053541
  • Uploader: henmere »
  • Date: over 13 years ago
  • Size: 434 KB .jpg (1296x1812) »
  • Source: pixiv.net/artworks/17211423 »
  • Rating: Sensitive
  • Score: 1
  • Favorites: 1
  • 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 13 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: user:henmere status:deleted next ›
    • « ‹ prev Pool: Touhou - Tutoring Flan-chan ~Elementary Number Theory~ (Fujii Tatsuya) next › »
  • Comments
  • Painiac
    over 13 years ago
    [hidden]

    God My Oh, this is Fibonacci sequence? Number series? Homomorphisms? Linear algebra? Mathematical analysis?

    ... Oh wow. Do descriptive geometry, I dare you!

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

    I dare any translators to take this one up!

    Seriously, this is one weird doujin. The work of a true fan! Who else but a hardcore fan could imagine a math textbook Touhou doujin?

  • 0
  • Reply
    • Copy ID
    • Copy Link
    Painiac
    over 13 years ago
    [hidden]

    Oh yea, translating math is just lunatic level. Translator just should understand text, and find original french/english definitions, to keep it in shape. Translator also has to know math ,,language". You know, even if you pay money to profesional translator, his translation will suck dick, if he doesn't know math.

  • 1
  • Reply
    • Copy ID
    • Copy Link
    Shadowflames
    over 13 years ago
    [hidden]

    It's not so much as understanding the language. It's easy enough to understand with all the universal symbols thrown in.

    IT'S TYPING THE DAMN SYMBOLS! OH GOD WHERE THE HELL IS THE SIGMA KEY ON THE KEYBOARD!?

    Anyways, I've used the functional notations used in computer languages to emulate for now. Enjoy. And be thankful that I'm a masochist.

  • 1
  • Reply
    • Copy ID
    • Copy Link
    Seika
    over 13 years ago
    [hidden]

    For greek alphabet, you could just type it in Japanese, シグマ. One of the conversion candidates include the Greek letter Σ.

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

    I see my challenge was met. I am very impressed!

  • 0
  • Reply
    • Copy ID
    • Copy Link
    zephyredx
    over 13 years ago
    [hidden]

    Awesome! I have not seen the Moebius function too often yet, but I do know it can do some fascinating tricks.

  • 0
  • Reply
    • Copy ID
    • Copy Link
    [Theorem 10.2] SUM(phi(d), d|n)=n [Proof] Suppose that d is a divisor of n. Further, suppose that we have a natural number x other than 1 or n such that (x, n) = d. Consequently we have x=dx', and n=dn' and (x', n') = 1, and the number of x' is the value of Euler's function for n/d, that is, phi(n/d). Similarly evaluate all n's proper divisors other than 1, and we have SUM(phi(n/d), d|n) = n. Again, n/d is n's divisor, like d. Therefore, we have SUM(phi(d), d|n) = n. I have actually never learned anything about Euler's Function, cyclotonic polynomials, and generators for cyclic groups, so please feel free to correct me.
    Theorem 10.2 seems like a really neat theorem, but in reality, we know that there isn't any function in number theory that has that property other than phi(n). To show that, we want to prove that if SUM(F(d), d|n)=n, then F(n) = phi(n). How do we prove that? Given that F(n) is any function in number theory, G(n)=SUM(F(n), d|n) is also a function in number theory. Let's use a concrete example to think about how to obtain F(n) from G(n). Let n=35, then we have d=1, 5, 7, 35... Please, Miss Flan?
    That's right. But to have a generalized proof of that is difficult. The next segment will simplify it with the Moebius Function.
    Euler's function
    Terms / Privacy / Upgrade / Contact /