This is an interesting interview question for someone to attempt without any computer or calculator help. It's a great way to explore someone's thought process.
Other than quickly grouping numbers and not missing any (like one sounds like it starts with W), I'm not sure if there's a super quick method for this.
The answer happens to be 69.
Extension for the Computer Science students that have too much time on their hands:-
For what values of \(n\) does the number 666 stay in the same position when the list of numbers 1 to \(n\) are ordered alphabetically?
Solution
\(n=929\) works and is the only solution. With the introduction of 930 to the list of numbers, which falls before 666 when writen in words, 666 is pushed later in the list and therefore doesn't retain its original position. The introduction of more numbers will only push 666 further back in the list, so no other value of \(n\) will work.
No comments:
Post a Comment