Skip to main content

Use these calculator tricks to impress and astound your friends!


Is That Your Final Answer?
  1. Have someone pick a number between 1 and 9.
  2. Now have him use a calculator to first multiply it by 9, and then multiply it by 12,345,679 (notice there is no 8 in that number!).
  3. Have the person show you the result so you can tell him the original number he selected! How? Easy. If he selected 5, the final answer is 555,555,555. If he selected 3, the final answer is 333,333,333. The reason: 9 x 12345679 = 111111111. You multiplied your digit by 111111111. (By the way, that 8-digit number (12,345,679) is easily memorized: only the 8 is missing from the sequence.)
The 421 Loop
  1. Pick a whole number and enter it into your calculator.
  2. If it is even, divide by 2. If it is odd, multiply by 3 and add 1.
  3. Repeat the process with the new number over and over. What happens?
  4. The sequence always ends in the "loop": 4.....2.....1.....4.....2.....1...
Example: Start with 13.
13 is odd, so we multiply by 3 and add 1. We get 40. (13 x 3 = 39 + 1= 40)
40 is even, so we divide by 2. We get 20. (40 / 2 = 20)
20 is even, so we divide by 2 and get 10.
10 is also even so we divide by 2 again and get 5.
5 is odd so we multiply by 3 and add 1. We get 16.
16 is even, so we divide by 2 and get 8.
8 is also even so we divide by 2 again and get 4.
4 is even so we divide by 2. We get 2.
2 is even, so we divide by 1 and get 1.
1 is odd, so we multiply by 3 and add 1. We get 4.
4 is even so we divide by 2. We get 2. And so we begin the loop 4.....2.....1.....4.....2.....1...
Good Luck or Bad Luck?
  1. Have someone secretly select a three-digit number and enter it twice into her calculator. (For example: 123123) Have her concentrate on the display. You will try to discern her thoughts!
  2. From across the room (or over the phone), announce that the number is divisible by 11. Have her verify it by dividing by 11.
  3. Announce that the result is also divisible by 13. Have her verify it.
  4. Have him divide by his original three-digit number.
  5. Announce that the final answer is 7.
You can use this to predict Good Luck for him. If you wish to predict Bad Luck, have him divide by 7 in step 3; the final answer will be 13.

Why does this work? Entering a three-digit number twice (123123) is equivalent to multiplying it by 1001. (123 x 1001 = 123,123). Since 1001 = 7 x 11 x 13, the six-digit number will be divisible by 7, 11, 13, and the original three-digit number.

The Secret of 73
  1. For this trick, secretly write 73 on a piece of paper, fold it up, and give to an unsuspecting friend.
  2. Now have your friend select a four-digit number and enter it twice into a calculator. (For example: 12341234)
  3. Announce that the number is divisible by 137 and have him verify it on his calculator.
  4. Next, announce that he can now divide by his original four-digit number. After he has done so, dramatically command him to look at your prediction on the paper. It will match his calculator display: 73!
Why does this work? Entering a four-digit number twice (12341234) is equivalent to multiplying it by 10001. (1234 x 10001 = 12341234). Since 10001 = 73 x 137, the eight-digit number will be divisible by 73, 137, and the original four-digit number.

The 6174 loop
  1. Select a four-digit number. (Do not use 1111, 2222, etc.)
  2. Arrange the digits in increasing order.
  3. Arrange the digits in decreasing order.
  4. Subtract the smaller number from the larger number.
  5. Repeat steps 2, 3, and 4 with the result, and so on. What happens?
Let's try 7173
Arrange the digits in increasing order. 1377
Arrange the digits in decreasing order. 7731
Subtract the smaller number from the larger number. 7731 - 1377 = 6354
Repeat the process with 6354
6543 - 3456 = 3087
8730 - 0378 = 8352
8532 - 2358 = 6174
7641 - 1467 = 6174
7641 - 1467 = 6174
7641 - 1467 = 6174 (we're in a loop!)
Amazingly, all four-digit numbers (not multiples of 1111) end up in the 6174-loop. No reason has been found for this phenomenon.

The Golden Prediction
This trick takes considerable time, but the effect is spectacular.

Give someone a sheet of paper and a pencil and tell him to:
  1. Number the first 25 lines (1, 2, 3,...).
  2. Write any two whole numbers on the first two lines.
  3. Add the two numbers and write the sum on the third line.
  4. Add the last two numbers and write the sum on the next line.
  5. Continue this process (add the last two, write the sum) until he has 25 numbers on his list.
  6. Select any number among the last five on his list, and divide by the previous number (the number above it). Now for the trick!

    Remind him that you do not know his original two numbers or any of the 25 numbers, that you do not know which of the 25 numbers he selected right now, and therefore you cannot possibly know the number on the display.

    With great concentration and much difficulty, you divine the number presently on his calculator: "I'm getting a One... then something funny - oh! a decimal point! Then... a Six.. another One.. and an Eight, I think.. Now I'm getting a blank.. nothing... Oh! It's a Zero!.. then a Three... and... another Three?... then a Nine... had enough?"

    That's right! If your subject selects any number between the last five (#21 through #25) and divides it by the number above it, he'll always get 1.618033989..., which just happens to be the 
    Golden Mean!(provided, of course, he did all the addition correctly in steps 3-5 above)

    Why does this work? It's an incredible bit of mathematical trivia. Begin with any two whole numbers, make a 
    Fibonacci-type addition list, take the ratio of two consecutive entries, and the ratio approaches the Golden Mean! The further out we go, the more accurate it becomes. That's why we need 25 numbers: to obtain sufficient accuracy. The proof requires familiarity with the Fibonacci Sequence, pages of algebra, and a knowledge of Limits, all of which go far beyond the scope of this site.

    Interesting fact: if you divide one of your last 5 numbers by the next number (instead of the previous number), the result is the same decimal without the leading 1. (0.618033989)
Hit the "back" button on the browser

Comments

Popular posts from this blog

Maxon Cinema 4D Studio R13.058 full Keygen Cracked Version | Mediafire Torrent Download Link

Download Maxon CINEMA 4D Studio Full Version With Keygen -Everything You Need for High-End 3D 32 and 64 bit MAXON CINEMA 4D STUDIO R13.058 (x86/x64) CINEMA 4D Studio is the very best that MAXON has to offer for professional 3D artists. If you want to create advanced 3D graphics but need a helping hand to ensure you create jaw-dropping graphics quickly and easily, then this is the choice for you.                     All You Ever Wanted This is our top-of-the-line product. It not only contains everything the other CINEMA 4D versions offer - it goes far beyond. CINEMA 4D Studio has all the tools you need to tackle even the most complex project. Minimum System Requirements Windows XP, Vista or 7 running on Intel or AMD CPU with SSE2-Support; Mac OS X 10.5.8 or higher running on an Intel-based Mac; 1024 MB free RAM, DVD ROM drive. Standard DVD installation can take up to 4 GB of disk space. Software must be registered for permanent use. SUPPORTED OPERATING SYS

C Program to add two matrices using pointers.

  #include<stdio.h> main() { int a[5][5],b[5][5],c[5][5],i,j,m,n; printf("\n Enter the Dimension of the Matrix:\n"); scanf("%d%d",&m,&n); printf("\nEnter the Elements of the first matix:"); for(i=0;i<m;i++) { for(j=0;j<n;j++) { scanf("%d",(*(a+i)+j)); } } printf("\nEnter the elements of the second matrix:\n"); for(i=0;i<m;i++) { for(j=0;j<n;j++) { scanf("%d",(*(b+i)+j)); } } for(i=0;i<m;i++) { for(j=0;j<n;j++) { *(*(c+i)+j)=*(*(a+i)+j)+ *(*(b+i)+j); } } printf("\nResultantMatrix:\n"); for(i=0;i<m;i++) { for(j=0;j<n;j++) { printf("%5d",*(*(c+i)+j)); } printf("\n"); } getch(); } Output:  Enter the Dimension of the Matrix: 2  2 Enter the Elements of the first matix: 1   2   3   4 Enter the elements of the second matrix: 9   8   7  6 ResultantMatrix:  

C Program to create a Teapot using OpenGL

  C Program to create a Teapot using OpenGL # include <stdio.h> # include <GL/glut.h> void wall ( double thickness ) { glPushMatrix ( ) ; glTranslated ( 0.5 , 0.5 * thickness , 0.5 ) ; glScaled ( 1.0 , thickness , 1.0 ) ; glutSolidCube ( 1.0 ) ; glPopMatrix ( ) ; } void tableLeg ( double thick , double len ) { glPushMatrix ( ) ; glTranslated ( 0 , len / 2 , 0 ) ; glScaled ( thick , len , thick ) ; glutSolidCube ( 1.0 ) ; glPopMatrix ( ) ; } void table ( double topWid , double topThick , double legThick , double legLen ) { glPushMatrix ( ) ; glTranslated ( 0 , legLen , 0 ) ; glScaled ( topWid , topThick , topWid ) ; glutSolidCube ( 1.0 ) ; glPopMatrix ( ) ; double dist = 0.95 * topWid / 2.0 - legThick / 2.0 ; glPushMatrix ( ) ; glTranslated ( dist , 0 , dist ) ; tableLeg ( legThick , legLen ) ; glTranslated ( 0.0 , 0.0 , - 2 * dist ) ; tableLeg ( legThick , legLen ) ; glTransla