A little guideline Go to the Impossible n'est pas français challenge
Global Rank: 626
Totalscore: 42692
Posts: 22
Thanks: 16
UpVotes: 11
Registered: 18y 176d
The User is Offline
A little guideline
Jun 08, 2009 - 08:57:09 (17y 148d)
Jun 08, 2009 - 08:57:09 (17y 148d)
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?
Global Rank: 121
Totalscore: 156572
Posts: 13
Thanks: 17
UpVotes: 10
Registered: 18y 128d
The User is Offline
A little guideline
Jun 08, 2009 - 19:41:57 (17y 148d)
Jun 08, 2009 - 19:41:57 (17y 148d)
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.
Global Rank: 626
Totalscore: 42692
Posts: 22
Thanks: 16
UpVotes: 11
Registered: 18y 176d
The User is Offline
A little guideline
Jul 21, 2009 - 19:32:17 (17y 105d)
Jul 21, 2009 - 19:32:17 (17y 105d)
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.
Global Rank: 31417
Totalscore: 0
Posts: 275
Thanks: 250
UpVotes: 189
Registered: 26y 341d
Last Seen: 0s
The User is Online
A little guideline
Sep 12, 2009 - 00:05:07 (17y 52d)
Sep 12, 2009 - 00:05:07 (17y 52d)
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.
Global Rank: 198
Totalscore: 110647
Posts: 1795
Thanks: 1390
UpVotes: 961
Registered: 18y 258d
Last Seen: 64d 23h
The User is Offline
A little guideline
Dec 01, 2009 - 20:14:46 (16y 337d)
Dec 01, 2009 - 20:14:46 (16y 337d)
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.
Global Rank: 1449
Totalscore: 18949
Posts: 18
Thanks: 19
UpVotes: 15
Registered: 17y 235d
Last Seen: 13y 40d
The User is Offline
A little guideline
Jan 30, 2010 - 14:58:38 (16y 277d)
Jan 30, 2010 - 14:58:38 (16y 277d)
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....
Global Rank: 185
Totalscore: 113976
Posts: 21
Thanks: 15
UpVotes: 21
Registered: 18y 10d
Last Seen: 1y 51d
The User is Offline
A little guideline
Feb 09, 2010 - 20:20:26 (16y 267d)
Feb 09, 2010 - 20:20:26 (16y 267d)
Quote from vs4vijay
i think this can be done using linux's bc(calculator.)...
dont think so ;P
Last edited by dxer - Feb 09, 2010 - 20:21:30
Global Rank: 535
Totalscore: 48908
Posts: 34
Thanks: 49
UpVotes: 36
Registered: 16y 114d
Last Seen: 6y 59d
The User is Offline
RE: A little guideline
Jul 04, 2011 - 09:43:52 (15y 122d)
Jul 04, 2011 - 09:43:52 (15y 122d)
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
Quote from 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 have subscribed to this thread and receive emails on new posts.
1 people are watching the thread at the moment.
This thread has been viewed 11423 times.
1 people are watching the thread at the moment.
This thread has been viewed 11423 times.