[CODE]IFAC: cracking composite
49837306273
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 36-bit integer
Rho: using X^2-5 for up to 14 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 223241, -190548) and (1, 499185, -216785)
of discriminants
49837306273 and 249186531365, respectively
SQUFOF: square form (287^2, 366943, -347641) on second cycle
after 260 iterations, time = 0 ms
SQUFOF: found factor 1 from ambiguous form
after 115 steps on the ambiguous cycle, time = 0 ms
SQUFOF: square form (288^2, 62545, -138423) on first cycle
after 430 iterations, time = 0 ms
SQUFOF: found factor 97379 from ambiguous form
after 214 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 511787
IFAC: factor 511787
is prime
IFAC: factor 97379
is prime
IFAC: prime 97379
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 511787
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
49838524607
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 36-bit integer
Rho: using X^2-5 for up to 14 rounds of 32 iterations
Rho: time = 0 ms, 13 rounds
found factor = 42727
IFAC: cofactor = 1166441
IFAC: factor 1166441
is prime
IFAC: factor 42727
is prime
IFAC: prime 42727
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 1166441
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
2721817661
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 32-bit integer
Rho: using X^2+1 for up to 14 rounds of 32 iterations
Rho: time = 0 ms, 10 rounds
found factor = 83653
IFAC: cofactor = 32537
IFAC: factor 83653
is prime
IFAC: factor 32537
is prime
IFAC: prime 32537
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 83653
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
54334848889
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 36-bit integer
Rho: using X^2-5 for up to 14 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 233097, -159370) and (1, 521223, -207179)
of discriminants
54334848889 and 271674244445, respectively
SQUFOF: square form (427^2, 506629, -20569) on second cycle
after 32 iterations, time = 0 ms
SQUFOF: found factor 126233 from ambiguous form
after 19 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 430433
IFAC: factor 430433
is prime
IFAC: factor 126233
is prime
IFAC: prime 126233
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 430433
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
365960156741
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 39-bit integer
Rho: using X^2-11 for up to 14 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 604945, -425929) and (1, 1352701, -197076)
of discriminants
365960156741 and 1829800783705, respectively
SQUFOF: square form (317^2, 443633, -420817) on first cycle
after 250 iterations, time = 0 ms
SQUFOF: found factor 472909 from ambiguous form
after 138 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 773849
IFAC: factor 773849
is prime
IFAC: factor 472909
is prime
IFAC: prime 472909
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 773849
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
10960414475993
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 44-bit integer
Rho: using X^2-5 for up to 18 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 3310651, -1108048) and (1, 7402841, -4377171)
of discriminants
10960414475993 and 54802072379965, respectively
SQUFOF: square form (1867^2, 1089215, -3845415) on second cycle
after 4858 iterations, time = 0 ms
SQUFOF: found factor 1 from ambiguous form
after 2488 steps on the ambiguous cycle, time = 0 ms
SQUFOF: square form (536^2, 2917221, -2132153) on first cycle
after 4946 iterations, time = 0 ms
SQUFOF: ...but the root form seems to be on the principal cycle
SQUFOF: square form (1551^2, 5632927, -2397759) on second cycle
after 5224 iterations, time = 0 ms
SQUFOF: found factor 545161 from ambiguous form
after 2620 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 20104913
IFAC: factor 20104913
is prime
IFAC: factor 545161
is prime
IFAC: prime 545161
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 20104913
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
130880593285187
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 47-bit integer
Rho: using X^2-11 for up to 24 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 19815189, -16187460) and (1, 22880610, -14792162)
of discriminants
392641779855561 and 523522373140748, respectively
SQUFOF: square form (77^2, 22879994, -1191082) on second cycle
after 696 iterations, time = 0 ms
SQUFOF: found factor 3658709 from ambiguous form
after 347 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 35772343
IFAC: factor 35772343
is prime
IFAC: factor 3658709
is prime
IFAC: prime 3658709
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 35772343
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
109656764446793
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 47-bit integer
Rho: using X^2-11 for up to 24 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 10471711, -8294818) and (1, 23415461, -2097861)
of discriminants
109656764446793 and 548283822233965, respectively
SQUFOF: square form (3379^2, 20729739, -2596021) on second cycle
after 586 iterations, time = 0 ms
SQUFOF: found factor 4170377 from ambiguous form
after 288 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 26294209
IFAC: factor 26294209
is prime
IFAC: factor 4170377
is prime
IFAC: prime 4170377
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 26294209
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
16448057399
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 34-bit integer[/CODE]

[CODE]Rho: using X^2+3 for up to 14 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 222135, -53493) and (1, 256498, -251398)
of discriminants
49344172197 and 65792229596, respectively
SQUFOF: square form (379^2, 169694, -64390) on second cycle
after 162 iterations, time = 0 ms
SQUFOF: ...found nothing on the ambiguous cycle
after 87 steps there, time = 0 ms
SQUFOF: square form (323^2, 53383, -111413) on first cycle
after 530 iterations, time = 0 ms
SQUFOF: found factor 53699 from ambiguous form
after 264 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 306301
IFAC: factor 306301
is prime
IFAC: factor 53699
is prime
IFAC: prime 53699
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 306301
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
58889746791332141
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 56-bit integer
Rho: using X^2+1 for up to 42 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 242672097, -32238683) and (1, 542631305, -197664420)
of discriminants
58889746791332141 and 294448733956660705, respectively
SQUFOF: square form (3473^2, 225112409, -170252335) on first cycle
after 6416 iterations, time = 0 ms
SQUFOF: ...but the root form seems to be on the principal cycle
SQUFOF: square form (3295^2, 228742171, -151210069) on first cycle
after 11836 iterations, time = 0 ms
SQUFOF: found factor 15199501 from ambiguous form
after 5936 steps on the ambiguous cycle, time = 16 ms
IFAC: cofactor = 3874452641
IFAC: factor 3874452641
is prime
IFAC: factor 15199501
is prime
IFAC: prime 15199501
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 3874452641
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
700068390570323
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 50-bit integer
Rho: using X^2+3 for up to 30 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 45827995, -11497736) and (1, 52917610, -28542298)
of discriminants
2100205171710969 and 2800273562281292, respectively
SQUFOF: square form (704^2, 45110965, -32891396) on first cycle
after 3560 iterations, time = 0 ms
SQUFOF: found factor 108413 from ambiguous form
after 1776 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 6457421071
IFAC: factor 6457421071
is prime
IFAC: factor 108413
is prime
IFAC: prime 108413
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 6457421071
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
70308163563190573
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 56-bit integer
Rho: using X^2+1 for up to 42 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 265156865, -126640587) and (1, 592908775, -585988060)
of discriminants
70308163563190573 and 351540817815952865, respectively
SQUFOF: square form (9659^2, 434027253, -437212394) on second cycle
after 2400 iterations, time = 0 ms
SQUFOF: found factor 190541251 from ambiguous form
after 1174 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 368991823
IFAC: factor 368991823
is prime
IFAC: factor 190541251
is prime
IFAC: prime 190541251
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 368991823
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
3914706400999321
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 52-bit integer
Rho: using X^2-5 for up to 34 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 62567613, -51120388) and (1, 139905439, -35803471)
of discriminants
3914706400999321 and 19573532004996605, respectively
SQUFOF: square form (2044^2, 62432613, -1009783) on first cycle
after 1174 iterations, time = 0 ms
SQUFOF: ...but the root form seems to be on the principal cycle
SQUFOF: square form (6380^2, 18890661, -21851749) on first cycle
after 1990 iterations, time = 0 ms
SQUFOF: found factor 1430381 from ambiguous form
after 1036 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 2736827741
IFAC: factor 2736827741
is prime
IFAC: factor 1430381
is prime
IFAC: prime 1430381
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 2736827741
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
2131191994788359
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 51-bit integer
Rho: using X^2+5 for up to 32 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 79959839, -32864789) and (1, 92329670, -4211134)
of discriminants
6393575984365077 and 8524767979153436, respectively
SQUFOF: square form (3979^2, 79020915, -2357043) on first cycle
after 120 iterations, time = 0 ms
SQUFOF: found factor 244901 from ambiguous form
after 63 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 8702259259
IFAC: factor 8702259259
is prime
IFAC: factor 244901
is prime
IFAC: prime 244901
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 8702259259
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
1102454807185913029
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 60-bit integer
Rho: using X^2-5 for up to 50 rounds of 32 iterations
Rho: time = 0 ms, 21 rounds
found factor = 6909547
IFAC: cofactor = 159555294607
IFAC: factor 159555294607
is prime
IFAC: factor 6909547
is prime
IFAC: prime 6909547
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 159555294607
appears with exponent = 1
IFAC: main loop: this was the last factor[/CODE]

[CODE]IFAC: cracking composite
11365516766085787
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 54-bit integer
Rho: using X^2+11 for up to 38 rounds of 32 iterations
Rho: time = 0 ms, 13 rounds
found factor = 64013
IFAC: cofactor = 177550134599
IFAC: factor 177550134599
is prime
IFAC: factor 64013
is prime
IFAC: prime 64013
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 177550134599
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
82908375352597
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 47-bit integer
Rho: using X^2-11 for up to 24 rounds of 32 iterations
Rho: time = 0 ms, 23 rounds
found factor = 1714963
IFAC: cofactor = 48344119
IFAC: factor 48344119
is prime
IFAC: factor 1714963
is prime
IFAC: prime 1714963
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 48344119
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
394510727366999
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 49-bit integer
Rho: using X^2-1 for up to 28 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 34402501, -26761499) and (1, 39724588, -4424563)
of discriminants
1183532182100997 and 1578042909467996, respectively
SQUFOF: square form (3269^2, 27439539, -10073679) on first cycle
after 1938 iterations, time = 0 ms
SQUFOF: ...but the root form seems to be on the principal cycle
SQUFOF: square form (3701^2, 11516255, -19180793) on first cycle
after 4882 iterations, time = 0 ms
SQUFOF: found factor 7312127 from ambiguous form
after 2338 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 53952937
IFAC: factor 53952937
is prime
IFAC: factor 7312127
is prime
IFAC: prime 7312127
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 53952937
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
706653000869
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 40-bit integer
Rho: using X^2+1 for up to 14 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 840625, -652561) and (1, 1879697, -1048134)
of discriminants
706653000869 and 3533265004345, respectively
SQUFOF: square form (383^2, 603429, -583763) on first cycle
after 1344 iterations, time = 0 ms
SQUFOF: ...but the root form seems to be on the principal cycle
SQUFOF: square form (467^2, 530905, -486949) on first cycle
after 1386 iterations, time = 0 ms
SQUFOF: found factor 89839 from ambiguous form
after 698 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 7865771
IFAC: factor 7865771
is prime
IFAC: factor 89839
is prime
IFAC: prime 89839
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 7865771
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
1451496582990409
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 51-bit integer
Rho: using X^2+5 for up to 32 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 38098511, -10643322) and (1, 85190861, -29257681)
of discriminants
1451496582990409 and 7257482914952045, respectively
SQUFOF: square form (2201^2, 82074871, -26896951) on second cycle
after 3370 iterations, time = 0 ms
SQUFOF: ...but the root form seems to be on the principal cycle
SQUFOF: square form (2883^2, 36763657, -3005710) on first cycle
after 6178 iterations, time = 0 ms
SQUFOF: found factor 2844229 from ambiguous form
after 3132 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 510330421
IFAC: factor 510330421
is prime
IFAC: factor 2844229
is prime
IFAC: prime 2844229
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 510330421
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
6810873395278529
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 53-bit integer
Rho: using X^2+7 for up to 36 rounds of 32 iterations
Rho: time = 0 ms, 22 rounds
found factor = 403327
IFAC: cofactor = 16886728127
IFAC: factor 16886728127
is prime
IFAC: factor 403327
is prime
IFAC: prime 403327
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 16886728127
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
415464790198968637
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 59-bit integer
Rho: using X^2+5 for up to 48 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 644565581, -497275269) and (1, 1441292457, -1097436584)
of discriminants
415464790198968637 and 2077323950994843185, respectively
SQUFOF: square form (25742^2, 1380396991, -64826059) on second cycle
after 132 iterations, time = 0 ms
SQUFOF: found factor 1488499 from ambiguous form
after 53 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 279116606863
IFAC: factor 279116606863
is prime
IFAC: factor 1488499
is prime
IFAC: prime 1488499
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 279116606863
appears with exponent = 1
IFAC: main loop: this was the last factor
IFAC: cracking composite
29355379363049741
IFAC: checking for pure square
IFAC: checking for odd power
IFAC: trying Pollard-Brent rho method
Rho: searching small factor of 55-bit integer
Rho: using X^2-11 for up to 40 rounds of 32 iterations
Rho: time = 0 ms, Pollard-Brent giving up.
IFAC: trying Shanks' SQUFOF, will fail silently if input
is too large for it.
SQUFOF: entering main loop with forms
(1, 171334115, -100054129) and (1, 383114729, -309626316)
of discriminants
29355379363049741 and 146776896815248705, respectively
SQUFOF: square form (1043^2, 169889007, -113321027) on first cycle
after 10626 iterations, time = 16 ms
SQUFOF: ...but the root form seems to be on the principal cycle
SQUFOF: square form (4375^2, 145836671, -105626707) on first cycle
after 12148 iterations, time = 0 ms
SQUFOF: found factor 154242059 from ambiguous form
after 6238 steps on the ambiguous cycle, time = 0 ms
IFAC: cofactor = 190320199
IFAC: factor 190320199
is prime
IFAC: factor 154242059
is prime
IFAC: prime 154242059
appears with exponent = 1
IFAC: main loop: 1 factor left
IFAC: prime 190320199
appears with exponent = 1
IFAC: main loop: this was the last factor[/CODE]

this is only 127 units in because that's the maximum I can get working.

[QUOTE=science_man_88;229554]this is only 127 units in because that's the maximum I can get working.[/QUOTE]

I can get 256
[code]v=vector(256);v[1]=276;for(i=2,#v,v[i]=sigma(v[i-1])-v[i-1])[/code]
in 1.825 seconds (1.903 if I turn on warnings and print out each index as I finish it). 512 takes about half a minute.

I got it working further i think lol just make a for loop around the for loop existant and the equation v[1]==v[127] at every loop though maybe v[1]==v[#v] would work faster lol.

with my extension method i got Aliquot(276) to 12601 in just over 11 seconds.

[QUOTE=science_man_88;229562]I got it working further i think lol just make a for loop around the for loop existant and the equation v[1]==v[127] at every loop though maybe v[1]==v[#v] would work faster lol.[/QUOTE]

Checking v[1]==v[127] will take perhaps 10 cycles. Checking it a thousand times will take 10,000 cycles. If you're using a 500 MHz machine, this takes 20 microseconds.

Using v[1]==v[#v] involves also calculating #v, so it might take an extra 5 microseconds.

But the whole calculation for the first thousand terms will take an hour or more, I expect. So it really doesn't matter. Essentially all of the time (certainly more than 99,.99%) is spent factoring.

[QUOTE=science_man_88;229564]with my extension method i got Aliquot(276) to 12601 in just over 11 seconds.[/QUOTE]

12601?

how would we be able to extend your method so it can go higher.

[QUOTE=kar_bon;229567]12601?[/QUOTE]

yep 100 * 127 -99 (lost to replacement) = (#v=12601) in 11 seconds.