Editing 1935: 2018

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 9: Line 9:
  
 
==Explanation==
 
==Explanation==
βˆ’
In this, the first of two [[:Category:New Year|New Year comics]] in a row, [[Megan]] wonders whether 2018 will be a {{w|Leap year|leap year}}. [[Cueball]] thinks 2018 will not be a leap year, and Megan responds that she "doubts anyone knows at this point." This appears to be a jab at people who suggest that anything they don't know is generally unknown. As Cueball says, leap years occur every four years (though there are a few exceptions - a year divisible by 100 is not a leap year, unless it is also  divisible by 400), adding an extra day to account for the fact that Earth takes a bit longer than 365 days to orbit the Sun. Therefore, most years that are a multiple of four are leap years. As Megan says, this is easy for odd-numbered years, since no odd numbers are divisible by four. However, for even-numbered years, it isn't quite as simple. (Though, since the number 2,000 is evenly divisible by 4, the problem can be reduced to the much simpler question of whether the number 18 is divisible by 4.)
+
In this, the first of two [[:Category:New Year|New Year comics]] in a row, [[Megan]] wonders whether 2018 will be a {{w|Leap year|leap year}}. [[Cueball]] thinks 2018 will not be a leap year, and Megan responds that she "doubts anyone knows at this point." This appears to be a jab at people who suggest that anything they don't know is generally unknown. As Cueball says, leap years occur every four years (though there are a few exceptions - a year divisible by 100 is not a leap year, unless it is also  divisible by 400), adding an extra day to account for the fact that Earth takes a bit longer than 365 days to orbit the Sun. Therefore, most years that are a multiple of four are leap years. As Megan says, this is easy for odd-numbered years, since no odd numbers are divisible by four. However, for even-numbered years, it isn't quite as simple. (Though, the problem can be reduced to the much simpler question of whether the number 18 is divisible by 4, since all integer multiples of 10^x, where x >= 2, are guaranteed to be divisible by 4.)
  
 
The last panel expresses a misunderstanding of modern public-key {{w|Cryptography|cryptography}}, which relies on the fact that it is difficult to factorize large numbers. Megan is applying this concept to the year, claiming that it is hard to determine whether or not 2,018 is a multiple of four and hence is a leap year. In reality, factorization is not needed here, since we already know the factor in question, which is four. Megan states that, if it were possible to factor large numbers with a calculator, modern cryptography would collapse. While true, it is true only for truly large numbers (hundreds of digits), and no factorization is needed in this case.
 
The last panel expresses a misunderstanding of modern public-key {{w|Cryptography|cryptography}}, which relies on the fact that it is difficult to factorize large numbers. Megan is applying this concept to the year, claiming that it is hard to determine whether or not 2,018 is a multiple of four and hence is a leap year. In reality, factorization is not needed here, since we already know the factor in question, which is four. Megan states that, if it were possible to factor large numbers with a calculator, modern cryptography would collapse. While true, it is true only for truly large numbers (hundreds of digits), and no factorization is needed in this case.

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)