Glycereine

i kept saying misses instead of forgotten keys hope i understood the process right Correct! I actually missed the second solution of it starting with a 0, which of course tells you nothing about how many times the code has changed. I know it's a fairly simple problem, but thanks for humoring me and working with the poor syntax .

My clues were probably misleading, they start in order from left to right. So my first clue refers to the furthest left digit (thousands place) and the last one refers to the furthest right digit (ones place).

Hopefully someone gets this while I'm teaching tonight. Good luck!

Yay I have to get back to work though or I'm in trouble :-p.

Wish I'd read this sooner, there were so many replies that I assumed someone had answered it already but I just now finally read through all the answers and realized no one had!

Remember that 2 odd numbers added also makes an even number.

I'm not that young. I was guessing:

!!

Thank you! Educational and interesting too

Sorry Randoms I wasn't criticizing your English, I don't know what octal numeral base is either, I was just curious. I'll look it up. Cheers!

An elderly professor arrives home without his key and realizes he must use the keypad he had installed for this reason. He is however not only habitually forgetful, but also extremely insecure. As such he has set up that each time he enters his house via the keypad (which he only does when he forgets his key) the combination will be changed before the next use. The number changes as follows: The first number is doubled and the 1's place of the double digit becomes the new first number. The tens place is carried and added to the second number. Again the 1's digit of this number is the new second number. The tens digit is added to the fourth number and the 1's digit of the this number is the new 4th number. The third number is increased by 3 (if it goes over 10 the ten's digit is discarded). Question 1: A. If the code is 0123, what was it last time the professor forgot his key? B. How many times has he forgotten his key? Questions 2: A. If the code is started with 1111 and it ended in 1 last time but now ends in 2, how many times has the professor forgotten his key.

This was what I was thinking too, but I can't find anything in the riddle that makes this different than any other like it so I'm stumped

Sorry but no

Unfortunately the number of phone numbers is pretty easy, but that's not what he's asking . He wants the sum of all the phone numbers, ie 0+1+2+3+4+5+7+8+10+11.... Also forgive my ignorance but what is octal numberical base? I think you looked at the chance of a 6 the same way I did in my first post, but then I realized I was wrong. Just because it has a 6 or a 9 in it doesn't mean it's a flippable number.

Also a good guess! But no dice, sorry.

Oh that actually fits quite well!! But alas, not what I'm looking for. When you see the answer you'll know it's the answer (I hope ) I have a hint that won't give it away but I'm saving it for later.

Unless final is correct, the 2nd post is right, which doesn't make a whole lot of sense to me.

Fun stuff!! - Got 100% on the OP's test but was close to running out of time twice - got 15.43 seconds then 19.24 seconds on the timed stroop test - Average of 1.1 second on the individual timed on (100% correct) - 8.86 for the last test with correct colors/names, 13.547 for different names/colors

I said red pickaxe. Only reason I didn't say hammer was that I have a pickaxe sitting within view. The first reply needs to be spoilered or removed