'X Factor' Challenge please help me to solve this...

[dorahan]

My friend had run in PEARL Programming and used with Pollard Algorithm... He said that he got these numbers: 23622726312840703036808659231601033245980573307067. But i fill those numbers and it's incorrect...

The source code is this:

use strict; use Math::BigInt lib => 'GMP'; sub fc ( $@ ) { my $x = shift; my $c = shift; my $n = shift; my $result = $x->copy()->bpow("2")->badd($c)->bmod($n); return $result; } my $N = Math::BigInt->new('7393913335919140050521110339491123405991919445111971'); print "Factoring N = ", $N->bstr(), "\n"; my $a = Math::BigInt->new("2"); my $b = Math::BigInt->new("2"); my $c = Math::BigInt->new("1"); my $d =

Please helpp meeee... I don't know again what should i do next... please give me any hint and clue due to solve this challenge... thank youu so muchh for you who want to help me...

[martin_great_boy]

he he he



gw dah berhasill!



wkwkwkw

[dorahan]

this challange has been solved, someone told me that he used linux to process it and with some pollard algorithm. The number is so big. I'm still curious about the way to factoring it.


:: TOPIC CLOSED ::

[Belriel]

Has anybody solved this challange using GMP (and PHP)? I run into memory problems as GMP seems not to liberate memory before the program is finished. I found a bug entry at PHP: http://bugs.php.net/bug.php?id=33249 which says this problem is GMP related, so I would expect this happens in any programming language. I have raised the memory limit of PHP from 128MB to 2GB but this is still not enough to find the prime factor. I'll probably have to call the script recursively to release the memory GMP consumes between each call.