Since Pi is infinite and non-repeating, would that mean any finite sequence of non-repeating numbers should appear somewhere in Pi?
Since Pi is infinite and non-repeating, would that mean any finite sequence of non-repeating numbers should appear somewhere in Pi?
How about ANY FINITE SEQUENCE AT ALL?
It's almost sure to be the case, but nobody has managed to prove it yet.
Simply being infinite and non-repeating doesn't guarantee that all finite sequences will appear. For example, you could have an infinite non-repeating number that doesn't have any 9s in it. But, as far as numbers go, exceptions like that are very rare, and in almost all (infinite, non-repeating) numbers you'll have all finite sequences appearing.
Exceptions are infinite. Is that rare?
Yes. The exceptions are a smaller cardinality of infinity than the set of all real numbers.
Yes, compared to the infinitely more non exceptions. For each infinite number that doesn't contain the digit 9 you have an infinite amount of numbers that can be mapped to that by removing all the 9s. For example 3.99345 and 3.34999995 both map to 3.345. In the other direction it doesn't work that way.
Very rare in the sense that they have a probability of 0.
There are lot that fit that pattern. However, most/all naturally used irrational numbers seem to be normal. Maths has, however had enough things that seemed 'obvious' which turned out to be false later. Just because it's obvious doesn't mean it's mathematically true.
No, the fact that a number is infinite and non-repeating doesn't mean that and since in order to disprove something you need only one example here it is: 0.1101001000100001000001... this is a number that goes 1 and then x times 0 with x incrementing. It is infinite and non-repeating, yet doesn't contain a single 2.
This proves that an infinite, non-repeating number needn't contain any given finite numeric sequence, but it doesn't prove that an infinite, non-repeating number can't. This is not to say that Pi does contain all finite numeric sequences, just that this statement isn't sufficient to prove it can't.
you are absolutely right.
it just proves that even if Pi contains all finite sequences it's not "since it oa infinite and non-repeating"
That was quite an elegant proof
What about in the context of Pi?
Doesn't the sequence "01" repeat? Or am I misunderstanding the term.
A nonrepeating number does not mean that a sequence within that number never happens again, it means that the there is no point in the number where you can predict the numbers to follow by playing back a subset of the numbers before that point on repeat. So for 01 to be the "repeating pattern", the rest of the number at some point would have to be 010101010101010101... You can find the sequence "14" at digits 2 and 3, 104 and 105, 251 and 252, and 296 and 297 (I'm sure more places as well).
yeah, but non-repeating in terms of decimal numbers usually mean: you cannot write it as 0.(abc), which would mean 0.abcabcabcabc...
1/3 is infinite in decimal form, as a more common example. 0.333333333….
it repeats
But didn't you just give a counterexample with an infinite number? OP only said something about finite numbers.
Wouldn’t binary ‘10’ be 2, which it does contain? I feel like that’s cheating, since binary is just a mode of interpreting information …all numbers, regardless of base, can be represented in binary.
They're not writing in binary. They're defining a base 10 number that is 0.11, followed by a single 0, then 1, then two 0s, then 1, then three 0s, then 1, and so on. The definition ensures that it never repeats, but because it only contains 1 and 0, it would never contain any sequence with the numbers 2 through 9.
A number for which that is true is called a normal number. It’s proven that almost all real numbers are normal, but it’s very difficult to prove that any particular number is normal. It hasn’t yet been proved that π is normal, though it’s generally assumed to be.
I love the idea (and it's definitely true) that there are irrational numbers which, when written in a suitable base, contain the sequence of characters, "This number is provably normal" and are simultaneously not normal.
Technically to meet OPs criteria it needs only be a rich number in base 10, not necessarily a normal one. Although being normal would certainly be sufficient
The jury is out on whether every finite sequence of digits is contained in pi.
However, there are a multitude of real numbers that contain every finite sequence of digits when written in base 10. Here's one, which is defined by concatenating the digits of every non-negative integer in increasing order. It looks like this:
0 . 0 1 2 3 4 5 6 7 8 9 10 11 12 ...fun fact, "most" real numbers have this property. If you were to mark each one on a number line, you'd fill the whole line out. Numbers that don't have this property are vanishingly rare.
This is what allows pifs to work!
Thats very cool. It brings to mind some sort of espionage where spies are exchanging massive messages contained in 2 numbers. The index and the Metadata length. All the other spy has to do is pass it though pifs to decode. Maybe adding some salt as well to prevent someone figuring it out.
I'm a layman here and not a mathematician but how does it store the complete value of pi and not rounded up to a certain amount? Or do one of the libraries generate that?
You generate it when needed, using one of the known sequences that converges to π. As a simple example, the
pi()recipe here shows how to compute π to arbitrary precision. For an application like pifs you can do even better and use the BBP formula which lets you directly calculate a specific hexadecimal digit of π.
I want that project continues so hard. Sounds amazing
Thanks. I love these kind of fun OpenSource community projects/ideas/jokes whatever. The readme reminds me of ed
I can't tell if this is a joke or real code... like for this sentence below.
The cat is back.
Will that repo seriously run until it finds where that is in pi? However long it might take, hours, days, years, decades, and then tell you, so you can look it up quickly?
I can’t tell if this is a joke or real code
Yes.
Will that repo seriously run until it finds where that is in pi?
Sure. It'll take a very long while though. We can estimate roughly how long - encoded as ASCII and translated to hex your sentence looks like
54686520636174206973206261636b. That's 30 hexadecimal digits. So very roughly, one of each16^3030-digit sequences will match this one. So on average, you'd need to look about16^30 * 30 ≈ 4e37digits into π to find a sequence matching this one. For comparison, something on the order of 1e15 digits of pi were ever calculated.so you can look it up quickly?
Not very quickly, it's still
n log ntime. More importantly, information theory is ruthless: there exist no compression algorithms that have on average a >1 compression coefficient for arbitrary data. So if you tried to use π as compression, the offsets you get would on average be larger than the data you are compression. For example, your data here can be written written as 30 hexadecimal digits, but the offset into pi would be on the order of 4e37, which takes ~90 hexadecimal digits to write down.
it's actually unknown. It looks like it, but it is not proven
Also is it even possible to prove it at all? My completely math inept brain thinks that it might be similar to the countable vs uncountable infinities thing, where even if you mapped every element of a countable infinity to one in the uncountable infinity, you could still generate more elements from the uncountable infinity. Would the same kind of logic apply to sequences in pi?
Man, you're giving me flashbacks to real analysis. Shit is weird. Like the set of all integers is the same size as the set of all positive integers. The set of all fractions, including whole numbers, aka integers, is the same size as the set of all integers. The set of all real numbers (all numbers including factions and irrational numbers like pi) is the same size as the set of all real numbers between 0 and 1. The proofs make perfect sense, but the conclusions are maddening.
its been proven for some other numbers, but not yet for pi.
The term for what you're describing is a "normal number". As @lily33@lemm.ee correctly pointed out it is still an open question whether pi is normal. This is a fun, simple-language exploration of the question in iambic pentameter, and is only 3 minutes and 45 seconds long.
Merry Christmas!
It's remarkable how there are uncountably many non-normal numbers, yet they take up no space at all in the real numbers (form a null set), since almost all numbers are normal. And despite this, we can only prove normality for some specific classes of examples.
It helps me to think, how there are many "totally random" or non computable numbers, that are not normal because they don't contain the digit 1.
0.101001000100001000001 . . .
I'm infinite and non-repeating. Can you find a 2 in me?Are you trying to say the answer to their question is no? Because if so, you're wrong, and if not I'm not sure what you're trying to say.
The conclusion does not follow from the premises, as evidenced by my counterexample. It could be the case that every finite string of digits appears in the decimal expansion of pi, but if that's the case, a proof would have to involve more properties than an infinite non-repeating decimal expansion. I would like to see your proof that every finite string of digits appears in the decimal expansion of pi.
Are you Pi?
Shit, opsec fail.
It has not been proven either way but if pi is proven to be normal then yes. https://en.m.wikipedia.org/wiki/Normal_number
Not just any all finite number sequence appear in pi
Can you prove this? Or link a proof?
https://github.com/philipl/pifs
πfs is a revolutionary new file system that, instead of wasting space storing your data on your hard drive, stores your data in π! You'll never run out of space again - π holds every file that could possibly exist! They said 100% compression was impossible? You're looking at it!
I enjoyed this linked text:
If you compute it, you will be guilty of:
- Copyright infringement (of all books, all short stories, all newspapers, all magazines, all web sites, all music, all movies, and all software, including the complete Windows source code)
- Trademark infringement
- Possession of child pornography
- Espionage (unauthorized possession of top secret information)
- Possession of DVD-cracking software
- Possession of threats to the President
- Possession of everyone's SSN, everyone's credit card numbers, everyone's PIN numbers, everyone's unlisted phone numbers, and everyone's passwords
- Defaming Islam. Not technically illegal, but you'll have to go into hiding along with Salman Rushdie.
- Defaming Scientology. Which IS illegal--just ask Keith Henson.
Yes.
And if you're thinking of a compression algorithm, nope, pigeonhole principle.
no. it merely being infinitely non-repeating is insufficient to say that it contains any particular finite string.
for instance, write out pi in base 2, and reinterpret as base 10.
11.0010010000111111011010101000100010000101...it is infinitely non-repeating, but nowhere will you find a 2.
i've often heard it said that pi, in particular, does contain any finite sequence of digits, but i haven't seen a proof of that myself, and if it did exist, it would have to depend on more than its irrationality.
Isnt this a stupid example though, because obviously if you remove all penguins from the zoo, you're not going to see any penguins
The explanation is misdirecting because yes they're removing the penguins from the zoo. But they also interpreted the question as to if the zoo had infinite non-repeating exhibits whether it would NECESSARILY contain penguins. So all they had to show was that the penguins weren't necessary.
By tying the example to pi they seemed to be trying to show something about pi. I don't think that was the intention.
It does contain a 2 though? Binary ‘10’ is 2, which this sequence contains?
Like the other commenter said its meant to be interpreted in base10.
You could also just take 0.01001100011100001111.... as an example
this is correct but i think op is asking the wrong question.
at least from a mathematical perspective, the claim that pi contains any finite string is only a half-baked version of the conjecture with that implication. the property tied to this is the normality of pi which is actually about whether the digits present in pi are uniformly distributed or not.
from this angle, the given example only shows that a base 2 string contains no digits greater than 1 but the question of whether the 1s and 0s present are uniformly distributed remains unanswered. if they are uniformly distributed (which is unknown) the implication does follow that every possible finite string containing only 1s and 0s is contained within, even if interpreted as a base 10 string while still base 2. base 3 pi would similarly contain every possible finite string containing only the digits 0-2, even when interpreted in base 10 etc. if it is true in any one base it is true in all bases for their corresponding digits
Yeah. This is a plot point used in a few stories, eg Carl Sagan's "Contact"
Not accurate. Pi needs to be a normal number for that to happen, something yet to prove/disprove.
Replace numbers with letters, and you have Jorge Luis Borges' The Library of Babel.
https://libraryofbabel.info/ kinda blows my mind.
Yes
Can you prove this? Or link a proof?
I don't know of one but the proof is simple. Let me try (badly) to make one up:
If it doesn't go into a loop of some kind, then it necessarily must include all finite strings (that's a theoretical compsci term).
Basically, take a string of any finite length, and then view pi in inrements of this length. Calculate it out to double the amount of substrings of length of your target string's interval you have [or intervals]. Check if your string one of those intervals. If not, do it again until it is, doubling how long you calculate each time.
Because pi is non-repeating, each doubling in intervals must necessarily include at least one new interval from all other previous ones. And because your target string length is finite, you have a finite upper limit to how many of these doublings you have to search. I think it's n in the length of your target string.
Someone please check my work I'm bad at these things, but that's the general idea. It's also wildly inefficient This doesn't work with Infinite strings because of diagnonalization.
My guess would be that - depending on the number of digits you are looking for in the sequence - you could calculate the probability of finding any given group of those digits.
For example, there is a 100% probability of finding any group of two, three or four digits, but that probability decreases as you approach one hundred thousand digits.
Of course, the difficulty in proving this hypothesis rests on the computing power needed to prove it empirically and the number of digits of Pi available. That is, a million digits of Pi is a small number if you are looking for a ten thousand digit sequence
But surely given infinity, there is no problem finding a number of ANY length. It's there, somewhere, eventually, given that nothing repeats, the number is NORMAL, as people have said, and infinite.
The probability is 100% for any number, no matter how large, isn't it?
Smart people?
In theory, sure. In practice, are we really going to find a series of ten thousand ones? I would also like to hear more opinions from smart people
Yes, this is implied. It's also why many people use digits of pi as passwords and make the password hint "easy as pi".
I have a slightly unique version of this.
When I was in high school, one of the maths teachers had printed out pi to 100+ digits on tractor feed paper (FYI I am old) and run it around the top of the classroom as a nerdy bit of cornice or whatever.
Because I was so insanely clever(...), I decided to memorise pi to 20 digits to use as my school login password, being about the maximum length password you could have.
Unbeknownst to me, whoever printed it had left one of the pieces of the tractor feed folded over on itself when they hung it up, leaving out a section of the first 20 digits.
I used that password all through school, thinking i was so clever. Until i tried to unrelatedly show off my knowledge of pi and found I'd learned the wrong digits.
I still remember that password / pi to 20 wrong digits. On the one hand, what a waste of brain space. On the other hand, pretty secure password I guess?
I’m going to say yes to both versions of your question. Infinity is still infinitely bigger than any expressible finite number. Plenty of room for local anomalies like long repeats and other apparent patterns.