Editing 247: Factoring the Time

Jump to: navigation, search

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 11: Line 11:
 
His co-worker decides to mess with Cueball, so he switches the clock from 12-hour time (2:53 pm) to 24-hour time (14:53). This makes factorization more difficult, as the time now shown is a four digit number rather than a three digit number. The number 1,453 is actually a prime number, and so has no factors but one and itself. Cueball has less than one minute to determine this, which is nearly impossible to do without practice. In this time, Cueball would have to calculate if 1,453 is divisible by all primes between 2 and the square root of 1,453, which are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, and 37. However, there are {{w|Divisibility_rule|tricks}} to help you do this more quickly than doing {{w|Long_division|long divisions}}.
 
His co-worker decides to mess with Cueball, so he switches the clock from 12-hour time (2:53 pm) to 24-hour time (14:53). This makes factorization more difficult, as the time now shown is a four digit number rather than a three digit number. The number 1,453 is actually a prime number, and so has no factors but one and itself. Cueball has less than one minute to determine this, which is nearly impossible to do without practice. In this time, Cueball would have to calculate if 1,453 is divisible by all primes between 2 and the square root of 1,453, which are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, and 37. However, there are {{w|Divisibility_rule|tricks}} to help you do this more quickly than doing {{w|Long_division|long divisions}}.
  
βˆ’
In the title text, [[Randall]] claims that he applies the same challenge to {{w|highway location marker}}s. At highway speeds (60+ mph), they would show up at least once per minute. Combined with the need to also concentrate on driving, factorizing numbers in the allowed time becomes much more difficult despite the lower numbers on the markers. Also, paying attention to the road markers instead of the road itself would be quite terrifying. In some cases, it could cause a car crash at more than 60 mph, which would be bad.{{Citation needed}}
+
In the title text, [[Randall]] claims that he applies the same challenge to {{w|highway location marker}}s. At highway speeds (60+ mph), they would show up at least once per minute. Combined with the need to also concentrate on driving, factorizing numbers in the allowed time becomes much more difficult despite the lower numbers on the markers. Also, paying attention to the road markers instead of the road itself would be quite terrifying, and could cause a car crash at more than 60 mph. Obviously, this would be bad.{{Citation needed}}
  
 
An additional challenge would be to change the mile markers to kilometer markers (because as with the clock format, the latter is more common outside of the USA). That would result in the marker being a 1.6 times larger number, and thus harder to factor. Of course, factoring is now a secondary problem, as markers would appear 1.6 times as frequently.
 
An additional challenge would be to change the mile markers to kilometer markers (because as with the clock format, the latter is more common outside of the USA). That would result in the marker being a 1.6 times larger number, and thus harder to factor. Of course, factoring is now a secondary problem, as markers would appear 1.6 times as frequently.
Line 26: Line 26:
 
:Cueball: I wonder how long I can keep up.
 
:Cueball: I wonder how long I can keep up.
  
βˆ’
:[Zoomed back out on the man and Cueball. The man at the desk reaches back and presses a button on the clock.]
+
:[Zoomed back out on the man, and Cueball. The man at the desk reaches back and touches the clock.]
 
:''BEEP''
 
:''BEEP''
  

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)