Username: 
Password: 
Restrict session to IP 

A little guideline  Go to the Impossible n'est pas français challenge

Global Rank: 604
Totalscore: 38373
Posts: 18
Thanks: 12
UpVotes: 7
Registered: 12y 96d


The User is Offline
A little guideline
Google/translate1Thank You!1Good Post!0Bad Post! link
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?
Global Rank: 107
Totalscore: 157772
Posts: 13
Thanks: 17
UpVotes: 10
Registered: 12y 48d
mego`s Avatar

The User is Offline
A little guideline
Google/translate1Thank You!1Good Post!0Bad Post! link
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.
Global Rank: 604
Totalscore: 38373
Posts: 18
Thanks: 12
UpVotes: 7
Registered: 12y 96d


The User is Offline
A little guideline
Google/translate1Thank You!1Good Post!0Bad Post! link
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.
Global Rank: 23006
Totalscore: 0
Posts: 251
Thanks: 229
UpVotes: 161
Registered: 20y 262d
Last Seen: 0s
The User is Online
A little guideline
Google/translate2Thank You!2Good Post!0Bad Post! link
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.
Global Rank: 236
Totalscore: 84975
Posts: 1370
Thanks: 1214
UpVotes: 734
Registered: 12y 179d




Last Seen: 1d 15h
The User is Offline
A little guideline
Google/translate1Thank You!1Good Post!0Bad Post! link
It is planned to tag the challenges with categories one day.

This challenge would perfectly fit into the exploit section ;)
The geeks shall inherit the properties and methods of object earth.
Global Rank: 1224
Totalscore: 18787
Posts: 18
Thanks: 17
UpVotes: 14
Registered: 11y 155d
vs4vijay`s Avatar

Last Seen: 6y 325d
The User is Offline
A little guideline
Google/translate1Thank You!1Good Post!0Bad Post! link
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: 258
Totalscore: 79991
Posts: 19
Thanks: 13
UpVotes: 15
Registered: 11y 296d
dxer`s Avatar

Last Seen: 86d 8h
The User is Offline
A little guideline
Google/translate1Thank You!1Good Post!0Bad Post! link
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: 463
Totalscore: 48808
Posts: 34
Thanks: 46
UpVotes: 32
Registered: 10y 35d
Martin Thoma`s Avatar

Last Seen: 1y 18h
The User is Offline
RE: A little guideline
Google/translate1Thank You!1Good Post!0Bad Post! link
I'm trying to factorize 3979472463314875085840002857228600720282384996148243543352143582302262781295828387891781441314971190160417811911956695502719284157232823856745170795069181463088768150823640408439 at the moment.
Quote from Output
Correct 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 Happy
Redknee, tunelko, silenttrack, qdxy, n0tHappy, vs4vijay, dxer, TheHiveMind, Z, Ge0, samuraiblanco, arraez, jcquinterov, hophuocthinh, alfamen2, burhanudinn123, Ben_Dover, stephanduran89, braddie0 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 7917 times.