Psychic Computer

Log Out | Lost Password? | Topics | Search Contact | Register | My Profile | SO home | MOL home

Thread Originator Last Poster Posts Pages Last Post   Closed: New threads not accepted on this page

Author Message   MHD Citizen Username: Mayhewdrive Post Number: 1815 Registered: 5-2001 Posted on Wednesday, December 15, 2004 - 9:15 am:        http://www.dslextreme.com/users/exstatica/psychic.swf A website that can read your mind.   greenetree Supporter Username: Greenetree Post Number: 3520 Registered: 5-2001 Posted on Wednesday, December 15, 2004 - 9:41 am:        I figured it out, but won't blow it for others.   Mark Fuhrman Citizen Username: Mfpark Post Number: 977 Registered: 9-2001 Posted on Wednesday, December 15, 2004 - 11:30 am:        I don't get it. Everytime I concentrate on it the computer says, "tilt". Guess it really can read minds.   Duncan Citizen Username: Duncanrogers Post Number: 3637 Registered: 12-2001 Posted on Wednesday, December 15, 2004 - 2:22 pm:        note that the symbols change everytime you do it.   Tom Reingold Citizen Username: Noglider Post Number: 4758 Registered: 1-2003 Posted on Wednesday, December 15, 2004 - 2:48 pm:        http://www.digikitten.com/k.txt   Kalani Thielen Citizen Username: Kalani Post Number: 23 Registered: 8-2004 Posted on Wednesday, December 15, 2004 - 3:40 pm:        This was posted on this message board a few months ago. I gave an algebraic treatment something like: For two digit numbers: (10 * x + y) - (x + y) 10 * x + y - x - y 10 * x - x 9 * x So you'll find the predicted symbols at every multiple of 9 between 9 and 99 -- and your particular symbol at the multiple of 9 corresponding to the most significant digit of the number you picked. You'll also notice that there's a bug in the program, since it doesn't handle 0 (also a multiple of 9) correctly (e.g.: pick 03). Also, if you're interested in the larger pattern here, for our traditional base 10 numbers: ((10^0 * a0) + (10^1 * a1) + ... + (10^n * an)) - (a0 + a1 + ... + an) (10^1 - 1) * a1 + (10^2 - 1) * a2 + ... + (10^n - 1) * an Sum((10^i - 1) * ai) for i in 1..n And doing this for any base B number results in a number that's a multiple of B - 1 (at the very least). Not a very interesting pattern I guess, but you can see how it discards information about the least significant digit (hence the trick).