Live data from Hacker News

A formula for the nth digit of πœ‹ and πœ‹^n

arxiv.org

61–70 of 143 posts

Re: A formula for the nth digit of πœ‹ and πœ‹^n

#62
post #33

Earlier quoted context omitted.

The article title says "powers of πœ‹", so presumably an arbitrary digit.

I’m not sure that’s right. The abstract and text say the nth digit of \pi^n, and the worked example on page 2 uses the same n=1000 to find the thousandth digit of \pi^{1000}.

[deleted]

Re: A formula for the nth digit of πœ‹ and πœ‹^n

#64
post #54

Earlier quoted context omitted.

Exactly, the only possible "last digit" it could have (in keeping with the silly premise that it has one), is zero.

Why is zero different than any other number?

It acts as a terminator or terminal, see https://news.ycombinator.com/item?id=34391483.

Re: A formula for the nth digit of πœ‹ and πœ‹^n

#65
It is all curious, but it seems that procedure that calculates the n-th digit using some other functions that require O(n) calculations (i.e. Bernoulli numbers) is not that exciting, as it's just a speedup comparing to a naive calculation (maybe a big one but still).

Although because pi is a transcendental number maybe it is impossible to have an algorithm to return the n-th digit in O(1) operations? Does anyone know ?

Upd: thinking more about it, just to read all the digits of number n, one needs log(n) operations, so I guess anything that has performance of O(log(n)) can be considered easy (i.e. the digits of rational numbers can be computed in O(logn).

Re: A formula for the nth digit of πœ‹ and πœ‹^n

#68
Wanted to compliment this paper for being well written. I'm not a practicing mathematician but I was able to easily follow along here and that was a cool feeling.

Could someone who is a practicing mathematician speak to the practical application of this? From what I understand from reading this seems like an interesting curiosity but the Chudnovsky formula it refers to seems to be better at doing the same thing for any practical purpose.

Re: A formula for the nth digit of πœ‹ and πœ‹^n

#69

Earlier quoted context omitted.

This is one of my favorite software projects of all time. I remember seeing this several years ago and it has driven my imagination crazy since then.

But why?

For me, it stimulates a mental shift that could be good exercise elsewhere: instead of storing the string, you find the string somewhere and store its index.

It also stimulate the imagination: what other transcendental numbers might this work with? How long do you have to search in the digits to find your string? What can you say about the size of the index (how far you searched) vs your string length? Etc. It's patterns all the way down.

Re: A formula for the nth digit of πœ‹ and πœ‹^n

#70

It is all curious, but it seems that procedure that calculates the n-th digit using some other functions that require O(n) calculations (i.e. Bernoulli numbers) is not that exciting, as it's just a speedup comparing to a naive calculation (maybe a big one but still). Although because pi is a transcendental number maybe it is impossible to have an algorithm to return the n-th digit in O(1) operations? Does anyone know…

The normal method for computing digits of pi is not O(n), so this could still be interesting. I think it's probably better to compare this with the BBP formula [1]. The commonly used algorithm for pi I think still takes O(n log^3 n) time [2]

[1] https://en.wikipedia.org/wiki/Bailey%E2%80%93Borwein%E2%80%9...

[2] https://en.wikipedia.org/wiki/Chudnovsky_algorithm

Post reply on HN