![]() |
Привіт Гість ( Вхід | Реєстрація )
![]() |
nikelong |
![]() ![]()
Пост
#1
|
Тера ранчер ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() Група: Trusted Members Повідомлень: 11 909 З нами з: 19-March 05 Користувач №: 92 Стать: Чол ![]() |
![]() Проект "Eulernet" Официальный сайт Статистика - всё в куче, ищите команду Украины сами. На момент написания постинга мы - 198-е в мире. http://tools.1up.no/euler/ - статистика какого-то товарища. Нормально распарсенная. Статистика команды у него же - куууул http://euler413.narod.ru/ - Сайт по теме Find Minimal Equal Sums of Like Powers using Euler2000, available on the download page. The client automatically downloads ranges of numbers to work on. On February 6, 2003, a project member discovered the largest (6,2,5) result above 60,000. On December 8, 2002, a project member found a new upper limit for Taxicab(6): Taxicab(6) <= 24153319581254312065344, since 24153319581254312065344 = 289062063 + 5821623 = 288948033 + 30641733 = 286574873 + 85192813 = 270932083 + 162180683 = 265904523 + 174924963 = 262243663 + 182899223. The Taxicab problem isn't a part of the Minimal Equal Sums of Like Powers project, but this is a big discovery nonetheless. Version 4.21b of the client is available as of September 30, 2002. This version handles reserved work ranges better, points to the new eulernet.org domain automatically, and on the server side, allows for simultaneous client connections. Note: you should upgrade from version 4.18 and earlier to fix a significant client bug in those versions. Note: 4.21b has a bug which prevents the client from connecting to the server if you try to reserve more than the maximum 100 ranges. Use temporary version 4.21c to fix the bug. Note: the project server was switched to a new ISP and domain, eulernet.org, as of October 15, 2002. The client should use eulernet.org when trying to connect to the project server. If your client can't connect to the project server, try pressing Ctrl-U, then changing the server name from eulernet.org to euler.myip.org. This may solve your problem if the DNS is incorrect. ![]() Resta 6: 87.56% assigned, 86.08% finished. Exponents: 86083 finished, 1478 reserved, 12439 remaining. Rank TEAM Users Total Time Total Speed Ranges Solutions Last report % project 7.11.2008 Resta 6: 87.97% assigned, 86.52% finished. Exponents: 86522 finished, 1449 reserved, 12029 remaining. 80 Ukraine 16 1929h 16m 24s 41639 22 0 11/6/2008 0.09% 28.12.2008 Resta 6: 89.47% assigned, 87.12% finished. Exponents: 87120 finished, 2350 reserved, 10530 remaining. 68 Ukraine 16 3087h 8m 36s 41639 25 0 12/26/2008 0.14% 14.7.2009 Resta 6: 91.54% assigned, 89.94% finished. Exponents: 89938 finished, 1605 reserved, 8457 remaining. 64 Ukraine 25 3889h 27m 28s 56966 36 0 7/14/2009 0.16% Це повідомлення відредагував nikelong: Sep 18 2010, 21:11 |
![]() ![]() |
Death |
![]()
Пост
#2
|
![]() <script ///> ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() Група: Moderators Повідомлень: 6 371 З нами з: 5-November 03 З: Kyiv Користувач №: 26 Стать: НеСкажу Free-DC_CPID Парк машин: гидропарк jabber:deadjdona@gmail.com ![]() |
новости:
17th May 2009: Scott Chase sent two new results : (12,4,14) and (16,10,23). A project about computing solutions to (4,1,3) finished recently: http://euler413.narod.ru/ with the discovery of 4 new small solutions. You can get the source code here: http://robert.gerbicz.googlepages.com/ Christian Boyer created a site about Morpion Solitaire: http://www.morpionsolitaire.com/, where he keeps track of the best records. Uwe Hollerbach confirmed that TaxiCab(6) = 24153319581254312065344 in March 2008. The current best results of TaxiCab and CabTaxi are here: http://cboyer.club.fr/Taxicab.htm In May 2008, Uwe confirmed that CabTaxi(10) = 933528127886302221000. In November 2006, there was an article about Nuuti's discovery of (8,4,4): http://www.maa.org/editorial/mathgames/mat...s_11_13_06.html In June 2008, I (Jean-Charles Meyrignac) became the french campion of Mots Fléchés (swedish grids style). If you are interested in magic squares and sums of powers, I recommend that you take a look at Christian's page: http://www.multimagie.com/English/SquaresOfCubes.htm Peter J. Ansell maintains a page about sixth power: http://www.computer-man.demon.co.uk/ I finally updated the database.txt and dataprime.txt files ! Rolan Christofferson maintains a list of (6,1,7) solutions as a Google spreadsheet: https://spreadsheets.google.com/ccc?key=pNP...ozfQnE1_mCVdZVQ 31th January 2009: Sorry for the lack of recent since the last years. The project is now in its tenth year of computation ! A big thanks to all participants, let's hope that our computations will prove to be useful in a near future. I recently got some questions about the program, mainly to fix the problems. I'm very sorry to not react faster, mostly because I'm working on other projects now, but I don't think I can help a lot on these problems. Without Greg Childers' constant support for all these years, the project would have stopped a long time ago. The last years, the records didn't progress well (but I probably forgot a mail, so send me your results if you found something new). Today, Scott Chase discovered two new results on the twelveth power: (12,2,16) and (12,5,14). -------------------- |
![]() ![]() |
![]() |
Lo-Fi Версія | Поточний час: 18th September 2025 - 17:24 |