A little guideline Vai alla sfida "Impossible n'est pas français"
Posizione globale: 626
Punteggio totale: 42692
Posts : 22
Grazie: 16
Voti+: 11
Registrato: 18a 177gg
L'utente è Offline
A little guideline
08 Giu 2009 - 08:57:09 (17a 149gg)
08 Giu 2009 - 08:57:09 (17a 149gg)
The question is simple: is it possible to do this challenge without generating a huge list of primes before attempting?
P.S. Is it a special algorithm?
P.S. Is it a special algorithm?
Posizione globale: 121
Punteggio totale: 156572
Posts : 13
Grazie: 17
Voti+: 10
Registrato: 18a 128gg
L'utente è Offline
A little guideline
08 Giu 2009 - 19:41:57 (17a 148gg)
08 Giu 2009 - 19:41:57 (17a 148gg)
It is a special algorithm, but that won't help you.
Take everything into account, the title, the number of points assigned, number of solvers, etc. Sometimes things look harder than they actually are.
Good luck.
Take everything into account, the title, the number of points assigned, number of solvers, etc. Sometimes things look harder than they actually are.
Good luck.
Posizione globale: 626
Punteggio totale: 42692
Posts : 22
Grazie: 16
Voti+: 11
Registrato: 18a 177gg
L'utente è Offline
A little guideline
21 Lug 2009 - 19:32:17 (17a 105gg)
21 Lug 2009 - 19:32:17 (17a 105gg)
So as far as I understand, the algorithm is not important in this challenge?
Title doesn't help, since it says it is possible, despite it doesn't look like it.
3 points mean it shouldn't be difficult.
19 solvers mean it is quite difficult.
Considering POST is easily doable, the difficulty is concentrated in the factorization scheme.
I'll try using ecliptic curve and make sure the calculations use 100% CPU power, but what bothers me is the http connection initiation, which is ~1s and is really annoying when you have only 8 seconds and a huge number to factorise.
Title doesn't help, since it says it is possible, despite it doesn't look like it.
3 points mean it shouldn't be difficult.
19 solvers mean it is quite difficult.
Considering POST is easily doable, the difficulty is concentrated in the factorization scheme.
I'll try using ecliptic curve and make sure the calculations use 100% CPU power, but what bothers me is the http connection initiation, which is ~1s and is really annoying when you have only 8 seconds and a huge number to factorise.
Posizione globale: 31417
Punteggio totale: 0
Posts : 275
Grazie: 250
Voti+: 189
Registrato: 26a 342gg
Ultima visita: 1s
L'utente è Online
A little guideline
12 Set 2009 - 00:05:07 (17a 53gg)
12 Set 2009 - 00:05:07 (17a 53gg)
I analyzed the length of few numbers that are generated (~200) and i realized that there is a very small rate of numbers that can be factorized in that amount of seconds : like 4-5 / 100 .Even Pollard's Rho takes 'a lot' for such big number.So it is there a specific way intended to use or?
Edit : Now i passed it.Nice idea.
Edit : Now i passed it.Nice idea.
Posizione globale: 198
Punteggio totale: 110647
Posts : 1795
Grazie: 1390
Voti+: 961
Registrato: 18a 259gg
Ultima visita: 65gg 14ore
L'utente è Offline
A little guideline
01 Dic 2009 - 20:14:46 (16a 337gg)
01 Dic 2009 - 20:14:46 (16a 337gg)
It is planned to tag the challenges with categories one day.
This challenge would perfectly fit into the exploit section ;)
This challenge would perfectly fit into the exploit section ;)
The geeks shall inherit the properties and methods of object earth.
Posizione globale: 1449
Punteggio totale: 18949
Posts : 18
Grazie: 19
Voti+: 15
Registrato: 17a 236gg
Ultima visita: 13a 40gg
L'utente è Offline
A little guideline
30 Gen 2010 - 14:58:38 (16a 277gg)
30 Gen 2010 - 14:58:38 (16a 277gg)
i think this can be done using linux's bc(calculator.)...
I Would Love TO Change The World But They Wont Give Me The Source Code....
Posizione globale: 185
Punteggio totale: 113976
Posts : 21
Grazie: 15
Voti+: 21
Registrato: 18a 11gg
Ultima visita: 1a 51gg
L'utente è Offline
A little guideline
09 Feb 2010 - 20:20:26 (16a 267gg)
09 Feb 2010 - 20:20:26 (16a 267gg)
Citazione da vs4vijay
i think this can be done using linux's bc(calculator.)...
dont think so ;P
Ultima modifica: dxer - 09 Feb 2010 - 20:21:30
Posizione globale: 535
Punteggio totale: 48908
Posts : 34
Grazie: 49
Voti+: 36
Registrato: 16a 115gg
Ultima visita: 6a 60gg
L'utente è Offline
RE: A little guideline
04 Lug 2011 - 09:43:52 (15a 123gg)
04 Lug 2011 - 09:43:52 (15a 123gg)
I'm trying to factorize 3979472463314875085840002857228600720282384996148243543352143582302262781295828387891781441314971190160417811911956695502719284157232823856745170795069181463088768150823640408439 at the moment.
which should have been [233371896958934483L, 413852469328454047L, 497967773738436383L, 518876274982852741L, 524656654197321563L, 532648518587251529L, 755179966181612599L, 845399444534861453L, 916936649223911587L]
These nine factors are all greater than 10^17 but smaller than 10^18, the difference between the biggest and the smallest is about 6*10^17 ... wow ...
pyecm found two of these nine in about 5 minutes ... as I solved the challenge meanwhile, I'll stop pyecm.
Nice challenge
Citazione da OutputCorrect would have been "233371896958934483413852469328454047497967773738436383518876274982852741524656654197321563532648518587251529755179966181612599845399444534861453916936649223911587974762215384448371"
which should have been [233371896958934483L, 413852469328454047L, 497967773738436383L, 518876274982852741L, 524656654197321563L, 532648518587251529L, 755179966181612599L, 845399444534861453L, 916936649223911587L]
These nine factors are all greater than 10^17 but smaller than 10^18, the difference between the biggest and the smallest is about 6*10^17 ... wow ...
pyecm found two of these nine in about 5 minutes ... as I solved the challenge meanwhile, I'll stop pyecm.
Nice challenge
Redknee, silenttrack, n0tHappy, nonfungiblesecurity, WingeDD, vs4vijay, dxer, quangntenemy, TheHiveMind, Z, balicocat, Ge0, arraez, jcquinterov, hophuocthinh, alfamen2, burhanudinn123, Ben_Dover, stephanduran89, braddie0, fpombal, csuquvq utenti hanno sottoscritto il thread e ricevo le E-Mail di notifica.
1 persone stanno visualizzando il thread.
Questo thread è stato visualizzato 11426 volte.
1 persone stanno visualizzando il thread.
Questo thread è stato visualizzato 11426 volte.