![]() |
![]() |
#1 |
"Vincent"
Apr 2010
Over the rainbow
1011010001002 Posts |
![]() Code:
500499498 merge n=100 , terminate n= 369, 59 498497496 driver 2^3*3*7 n=901 496495494 merge n= 76, 50 088 220 494493492 merge n= 1, 460 389 184 492491490 driver 2^3*5 n=847 490489488 merge n=15, 4 349 170 488487486 driver 2*3 486485484 merge n=19, 135 880 788 484483482 driver 2*3^2 n=250 482481480 2^3*3 n=255 480479478 2^3*3 n=179 478477476 2^4*3 n=339 476475474 2^3*3 n=179 474473472 2^2*7 n=326 472471470 merge n=26, 85 095 920 470469468 merge n=467 last merge n=472, 17 323 160 468467466 driver 2^2*7 n=444 466465464 merge n=10, last merge n=19,11 302 240 464463462 driver 2^5*3 n=215 462461460 merge n=28, 47 486 810 460459458 n=48, n=48, 122 000 032 458457456 n=24, 394210340 456455454 driver 2^2*3^2 n=912 454453452 merge n=445, 357 770 840 452451450 driver 2^3*5 450449448 merge n=156, last merge 157, 186 959 990 448447446 merge n=469, terminate at n=512, 7 446445444 merge n=63, last merge n=67 39 293 672 444443442 driver 2^3*3 442441440 merge n=35, 162 732 856 440439438 n=487, 67 182 104 438437436 n=18, 40 626 820 436435434 driver 2^2*3^2 434433432 merge n=79, 78 543 456 432431430 driver 2^2*3^2 430429428 2^3*3 428427426 merge n=52, 22 507 960 426425424 n=6, 385 670 272 424423422 n=796, 98 912 870 422421420 n=18,65 068 328 420419418 n=98, terminate n=162, 3 418417416 driver 2^4*3 416415414 merge n=24, 307 964 480 414413412 n=13, 85 453 024 412411410 driver 2^4*3, n=355 410409408 2^3*3, n=202 408407406 2^3*3^3 406405404 merge n=23, 295 452,open end n=742, 90 digits 404403402 driver 2^5*3 n=565 402401400 2^3*3 400399398 merge n=191, terminate n=195, 1741 398397396 driver 2^2*7 n=1008 396395394 2^2*463 n=893 394393392 2^3*3^2 n=516 392391390 2^2*7 n=261 390389388 merge n=22, 173 295 740 388387386 driver 2^2*3 n=240 386385384 2^5*3 n=213 384383382 merge n=31, 221 314 220 382381380 driver 2^2*3 n=481 380379378 2^3*3^3 n=550 378377376 merge n=10, 101 241 350 376375374 driver 2*3^2 n=949 374373372 merge n=26, 86 334 310 372371370 n=81, terminate n=116, 1402 (C) 370369368 n=60, 33870, open end n=482, 113 digits 368367366 n=68, 162 733 214 366365364 n=43, 265 918 310 364363362 driver 2^3*5 n=460 362361360 merge n=41, 7 712 860 360359358 n=17, 85 151 940 358357356 driver 2^2*7, n=243 356355354 driver 2*3^2 n=754 354353352 merge n=15, 17 691 674 352351350 driver 2^3*3, n=941 350349348 merge n=16 288 157 700 348347346 merge n=32, 33 073 352 346345344 driver 2^5*3 344343342 merge n=79, terminate n=115, 109 342341340 n=12, 162 756 584 340339338 n=34, 85 530 550 338337336 n=409, 65 194 844 336335334 driver 2^2*3 n=429 334333332 merge n=10, 16 152 820 332331330 driver 2*3^2 n=440 330329328 2^2*7 n=1357 328327326 merge n=180, 230 145 228 326325324 n=26, 156 465 640 324323322 n=83, terminate n=124, 43 322321320 n=172, 30 101 600 320319318 n=331, 135 131 750 318317316 n=20, 23 913 500 316315314 driver 2^4*3 n=318 314313312 merge n=334, open end n=1486, 100 digits 312311310 driver 2^4*7 n= 791 310309308 merge n=35, open end n=680, 90 digits 308307306 driver 2^3*3 n= 151 306305304 merge n=55, terminate n=1917, 41 304303302 driver 2^4*3^3 n=275 302301300 merge n=312, 33 962 530 300299298 driver 2^2 *7 n= 452 298297296 merge n=611,67 838 750 296295294 n=93, terminate n=135, 601 294293292 driver 2*3*7 n=676 292291290 2^2*67 n=288 290289288 merge n=58, terminate n=138, 191 288287286 n=44, terminate n=91, 7 286285284 n=73, open end n=2013, 135 digits 284283282 driver 2*3^3 n=425 282281280 2^6*3 n=349 280279278 merge n=281, 57 253 720 278277276 n=29, 135 498 920 276275274 n=45, 263 620 910 274273272 n=592, 54 656 096 272271270 driver 2^2*5 n= 488 270269268 merge n=305, 25 769 920 268267266 driver 2^2*3, n=695 266265264 merge n=12, 230 012 176 264263262 n=117, 12 835 580 262261260 n=33, 118 131 664 260259258 driver 2^4*3 258257256 merge n=270, 28 773 640 256255254 driver 2^3*3 n=211 254253252 driver 2*3^5 n=427 252251250 merge n=52, 36 296 792 ![]() |
![]() |
![]() |
![]() |
#2 |
Nov 2008
2·33·43 Posts |
![]()
This is a waste of computing power. We have plenty of available sequences in Subproject #4, and there are loads more below 1M. Continue if you wish, but I don't care about your results. Neither do any other people here unless one forms a cycle of length greater than 28.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
ecm thing | 3.14159 | Miscellaneous Math | 3 | 2016-12-16 23:58 |
A next big thing | jasonp | Operation Kibibit | 23 | 2012-08-28 12:46 |
Very strange thing | nngs | Software | 4 | 2007-04-14 22:08 |
Hm... strange thing... | Yxine | Factoring | 1 | 2006-08-10 13:48 |
Can not be a good thing :( | SB2 | 3*2^n-1 Search | 7 | 2004-09-23 08:48 |