Editing Talk:1562: I in Team

Jump to: navigation, search
Ambox notice.png Please sign your posts with ~~~~

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 24: Line 24:
  
 
:::::: To make it clear: Pi is an endless string of digits after the decimal point, and there is no repeating element at the end, and it cannot be represented by a fraction. It is easy to (falsely) conclude that, to follow this rules, there is each and every (finite) sequence in it somewhere. However it is (with enough processing time) possible to determine any finite amount of digits of pi. So let's say we analyse the first 10^10^10^10 digits of pi, and you look for your finite sequence, let's say your social security number. Either it is in it (that is no proof that EVERY number-sequence is in there), or it is not. In case it is not, there is no proof (yet?), that there is not a certain "rule" after the (10^10^10^10)+1 digit, that e.g. the digit 5 is not appearing anymore. If your social security number contains a 5, it wouldn't be in pi if it's not within the first 10^10^10^10 digits, while pi's digits could still be non repeating and endless. Therefore it actually cannot be concluded that pi contains every finite sequence of numbers. --[[User:Lupo|Lupo]] ([[User talk:Lupo|talk]]) 09:24, 2 October 2019 (UTC)
 
:::::: To make it clear: Pi is an endless string of digits after the decimal point, and there is no repeating element at the end, and it cannot be represented by a fraction. It is easy to (falsely) conclude that, to follow this rules, there is each and every (finite) sequence in it somewhere. However it is (with enough processing time) possible to determine any finite amount of digits of pi. So let's say we analyse the first 10^10^10^10 digits of pi, and you look for your finite sequence, let's say your social security number. Either it is in it (that is no proof that EVERY number-sequence is in there), or it is not. In case it is not, there is no proof (yet?), that there is not a certain "rule" after the (10^10^10^10)+1 digit, that e.g. the digit 5 is not appearing anymore. If your social security number contains a 5, it wouldn't be in pi if it's not within the first 10^10^10^10 digits, while pi's digits could still be non repeating and endless. Therefore it actually cannot be concluded that pi contains every finite sequence of numbers. --[[User:Lupo|Lupo]] ([[User talk:Lupo|talk]]) 09:24, 2 October 2019 (UTC)
βˆ’
 
βˆ’
:::::: The numbers that contain all possible finite combinations of digits are called normal numbers. Square root of two, pi, ln(2), and e are all believed to be normal numbers, but there's no easy way to prove it.[[Special:Contributions/172.69.247.50|172.69.247.50]] 13:28, 28 June 2023 (UTC)
 
  
 
The arbitrariness of this saying was demonstrated considerably more elegantly in Jeffrey Rowland's Wigu: "There is no I in 'team', but there is in 'family'." [[Special:Contributions/198.41.242.93|198.41.242.93]] 11:56, 10 August 2015 (UTC)
 
The arbitrariness of this saying was demonstrated considerably more elegantly in Jeffrey Rowland's Wigu: "There is no I in 'team', but there is in 'family'." [[Special:Contributions/198.41.242.93|198.41.242.93]] 11:56, 10 August 2015 (UTC)

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)

Templates used on this page: