1. The word ‘hundrath’ in Old Norse, from which our ‘hundred’ derives, meant not 100 but 120.

2. 3435 - A Münchhausen Number has the property that the sum of its digits raised to themselves produces the original number. The only Münchhausen Number are 1 and 3435 (3435 = 3^3 + 4^4 + 3^3 + 5^5)

3. 2520 is the smallest number divisible by the numbers 1 through 10.

4. You can remember the value of Pi (3.1415926) by counting each word's letters in 'May I have a large container of coffee'.

5. If A=1,... Z=26, then the word PRIME is prime. (P+R+I+M+E --> 16+18+9+13+5 =61)

6. No Fibonacci number is divisible by 61.

7. 61!-60!+59!-...+1! is prime.

8. In base two number system, pi is 11.001001000011...

9. The digits 62 occur at the 61st & 62nd digits of phi, φ; AND The 61st & 62nd digits of e.

10. The 61st Fibonacci number (2,504,730,781,961) is the smallest Fibonacci number which contains all the digits from 0 to 9.

2. 3435 - A Münchhausen Number has the property that the sum of its digits raised to themselves produces the original number. The only Münchhausen Number are 1 and 3435 (3435 = 3^3 + 4^4 + 3^3 + 5^5)

3. 2520 is the smallest number divisible by the numbers 1 through 10.

4. You can remember the value of Pi (3.1415926) by counting each word's letters in 'May I have a large container of coffee'.

5. If A=1,... Z=26, then the word PRIME is prime. (P+R+I+M+E --> 16+18+9+13+5 =61)

6. No Fibonacci number is divisible by 61.

7. 61!-60!+59!-...+1! is prime.

8. In base two number system, pi is 11.001001000011...

9. The digits 62 occur at the 61st & 62nd digits of phi, φ; AND The 61st & 62nd digits of e.

10. The 61st Fibonacci number (2,504,730,781,961) is the smallest Fibonacci number which contains all the digits from 0 to 9.

My favorite mnemonic for remembering the first 20 decimals of pi is

ReplyDeleteHow I wish I could enumerate pi easily, since all these bullshit mnemonics prevent recalling any of pi's sequence more simply.

that's amazing. I will add this mnemonic in next post

Delete