TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Your birthdate in the decimal expansion of Pi

48 pointsby carljosephalmost 11 years ago

9 comments

kibibualmost 11 years ago
I love this sort of thing:<p>&gt; Be warned that 50 million digits of pi takes up 50 megabytes. This can take up to 4 hours to download with a 28.8k modem!
评论 #7876919 未加载
评论 #7877738 未加载
评论 #7876915 未加载
评论 #7876870 未加载
worldsayshialmost 11 years ago
An idea I&#x27;ve had, the answer is most probably no, but I found it interesting to think about, others may find it trivial:<p>Is there a number that (1) contains most subsequences and where (2) finding a certain subsequence is computationally efficient? Also, (3) finding a subsequence given a starting and end position should be efficient. If so, we have a efficient mean to transfer data. Just send the index positions. And we can store any data with just those two index positions. Then again, those index numbers are likely to be very very large. Perhaps we can in turn transform the index positions to smaller index positions by finding their positions in the sequence. Then we need a third number to signify the number of recursive uses of the storage.
评论 #7877083 未加载
评论 #7877047 未加载
评论 #7877055 未加载
评论 #7877082 未加载
评论 #7877857 未加载
rookonautalmost 11 years ago
Maybe of interest for some of you: <a href="http://baby.pirthday.com/" rel="nofollow">http:&#x2F;&#x2F;baby.pirthday.com&#x2F;</a> 8 days until the perfect creation date for your ultimate pi-baby (born 3&#x2F;14&#x2F;15).<p>Other essential services are: your age in pi (<a href="http://pirthday.com/" rel="nofollow">http:&#x2F;&#x2F;pirthday.com&#x2F;</a>) or seeing who has his pirthday today (<a href="http://happy.pirthday.com/" rel="nofollow">http:&#x2F;&#x2F;happy.pirthday.com&#x2F;</a>). Disclaimer: Logo has been created by a friend (@turboele), other stuff by me.
ccozanalmost 11 years ago
Interesting idea. Actually, just thinking, could be used for a pseudo-crypto app. Just send a series of origin numbers [n1,n2,n3...] and this translates to [pos1,pos2,pos3...] series of numbers. You can use also instead of Pi any other transcendental&#x2F;irrational number [0].<p>[0] <a href="http://www.numberworld.org/digits/" rel="nofollow">http:&#x2F;&#x2F;www.numberworld.org&#x2F;digits&#x2F;</a>
plgalmost 11 years ago
So if I take the latest Lady Gaga mp3 and look at the stream of bytes, and if I can find that identical stream of digits in the digits of Pi, does Lady Gaga (or her record company) &quot;own&quot; that portion of Pi? If yes, then WTF!?!? If no, why not, and what does this mean for the idea of copyright, anyway?
评论 #7880341 未加载
Aardwolfalmost 11 years ago
&gt; If, on the other hand, you act like a computer geek and use zero based indexing, then you get these numbers: 6, 27, 13598, 43611, 24643510<p>Heh, it says &quot;act like a computer geek&quot; and the numbers are not even in binary? :)
zak_mc_krackenalmost 11 years ago
I wonder if there is not a bug in the decompress program:<p><pre><code> for (i = 0; i &lt; FILE_SIZE; i++) { printf(&quot;%d%d&quot;, (buf[i]&amp;0xf0)&gt;&gt;4, buf[i] &amp; 0xf); } </code></pre> Shouldn&#x27;t this be &gt;&gt;8 ?
评论 #7876792 未加载
评论 #7876794 未加载
niraialmost 11 years ago
at what index does the ascii encoding of the entire works of Shakespeare begin?
评论 #7877231 未加载
评论 #7877352 未加载
chidalmost 11 years ago
Well mine isn&#x27;t within the first 50 million. In any case, what&#x27;s the relevance of this? Everything (with the correct encoding scheme) can be expressed somewhere in the decimal expansion of Pi.
评论 #7877186 未加载
评论 #7878208 未加载