Juggling Pi as a siteswap.—strach
Re: Pi as a siteswap.
Mon, 11 Apr 2005 19:43:04 +0100
Rory Parle <rpa...@soylentred.REMOVECAPS.net.INVAL...

I’d call it 0, but then I’m prone to zero-based indexing. I’d also call it wrong because 6 only appears there if you round up. That digit should be a 5.

  f(1) = 0 (3; 3 props)  f(2) = 0 (31; 2 props)  f(3) = 1 (141; 2 props)  f(4) = 12 (9793; 7 props)  f(5) = 8 (53589; 6 props)  f(6) > 50, I can’t be bothered to find it. I might explore this programmatically in the future.—Rory

Re: Pi as a siteswap.
11 Apr 2005 23:42:50 -0700
r...@scientist.com (RPN)

Well, one of the main conjectures with Pi is that it is a random number. This means that every sequence of digits that you can imagine repeats infinitely often in the digits of Pi. If this conjecture is true, then any proper siteswap of any length appears in Pi infinitely often. Now, that doesn’t answer your question regarding the position of the first n-length siteswap, but I hope it helps otherwise.—RPN