![]() |
|
|
#1 |
|
∂2ω=0
Sep 2002
República de California
19×613 Posts |
http://www.nytimes.com/2006/07/25/science/25puzz.html
(Since NYT online articles have a distressing habit of either vanishing or getting switched to for-pay-only mode after a few weeks, I've also created an unofficial Permalink.) One strange thing (at least on a quick initial reading) - the article mentions that for the 65-ring Chinese puzzle, a perfect solution requires 18446744073709551616 = 264 moves, which would seem to generalize straightforwardly to 2(number of rings) - 1 moves. Thus, for the "classic" 9-ring version of the same puzzle I would've expected a minimum of 256 moves to be required, but the article says the 9-ring version needs 341 moves for an ideal solution. Am I missing something? (I suppose actually buying one and trying it out might help, but if the formula were something more complicated than the aforementioned power-of-2 formula, I would certainly not expect the 65-ring version to have such a simple form.) Last fiddled with by ewmayer on 2006-07-26 at 19:00 |
|
|
|
|
|
#2 | |
|
Aug 2005
Brazil
5528 Posts |
Quote:
You can see the two sequences at Sloane, here and here. |
|
|
|
|
|
|
#3 |
|
Oct 2005
Fribourg, Switzerlan
22×32×7 Posts |
"Do it yourself" http://staff.ccss.edu.hk/jckleung/ninering/ ;)
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Riemann Wired article | clowns789 | Math | 1 | 2017-04-12 07:43 |
| Aliquot driver article available | schickel | Aliquot Sequences | 4 | 2011-06-29 09:55 |
| New article on aliquot sequences | schickel | mersennewiki | 0 | 2008-12-30 07:07 |
| Wikipedia article on SNFS | fivemack | Factoring | 2 | 2007-02-15 17:52 |
| new ECPP article | R. Gerbicz | GMP-ECM | 2 | 2006-09-13 16:24 |