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 655474
Character
- flandre scarlet 39694
- koakuma 10484
- patchouli knowledge 24924
Artist
- fujii tatsuya 36
General
- blonde hair 844249
- blush stickers 59320
- chibi 156314
- fang 159117
- hair ribbon 328428
- hat 743322
- head wings 28767
- highres 2442581
- long hair 2115383
- math 446
- multiple girls 289718
- necktie 262431
- purple eyes 415383
- purple hair 314529
- red eyes 696782
- red hair 286752
- redhead 27832
- ribbon 615053
- stick 3968
- teaching 184
- text 14819
- violet eyes 20295
- wings 241804
Meta
- translated 151942
- translation request 376275
Statistics
- Id: 736779
- Posted: 2011-12-14 08:55:36
by danbooru - Size: 1296x1812
- Source: img63.pixiv.net/img/laevateinn495/17211423_big_p2.jpg
- Rating: Safe
- Score: 0 (vote up/down)
Actually, it is. I'll introduce why on the next page.
496 is really close to 495, so is 495 special too?
The perfect numbers, starting from the lowest, are 6, 28, 496, 8128, etc. We still haven't found an odd perfect number yet.
[Theorem 6.5] Given that p=2^n-1 is prime, then (2^(n-1))p is a perfect number. Conversely, all even perfect numbers must be in this form. [Proof] The first half of this question can be proven with Theorem 6.2. For the second half, if m is an even perfect number, m=pa, where a is an odd number and p>=2. Apply theorem 6.3, and we have S(m) = S(a)*2^(n-1). Since m is perfect, we have S(m) = 2m, therefore S(a)*2^(n-1)=pa. Divide both sides by 2p-1 and we have S(a) = a + a/p. Since S(a) is an integer, p must be a divisor of S(a). Since a is also a divisor of a, a + a/p must be the sum of all two of a's divisors. Therefore, a is prime and a = p, Q.E.D.
[Theorem 6.3] T(n) and S(n) are multiplicative functions. The proof is trivial from Theorem 5.2.
[Definition 6.2] If for natural number n, S(n) = 2n (that is, the aliquot sum of n is equal to itself), n is called a perfect number. If S(n) < 2n, it is a deficient number, and if S(n) > 2n it is an abundant number.
[Theorem 6.4] the product of all n's divisors amount to n^(T(n)/2). [Proof] Suppose d is a divisor of n. Therefore, n = dd', where d' is another divisor of n. Do this for all divisors of n, and we have T(n)/2 pairs where the product of each pair is n. Q.E.D.
Number of <a href="http://en.wikipedia.org/wiki/Divisor">Divisors</a>, Sum of Divisors
![blonde_hair blush_stickers chibi fang flandre_scarlet fujii_tatsuya hair_ribbon hat head_wings highres koakuma long_hair math multiple_girls necktie patchouli_knowledge purple_eyes purple_hair red_eyes red_hair redhead ribbon stick teaching text the_embodiment_of_scarlet_devil touhou translated translation_request violet_eyes wings](https://safebooru.org//samples/731/sample_9c68f19ba1ebce2d347d9877c80420545c09a461.jpg?736779)
Edit | Respond
comment (0 hidden)