'X Factor' Challenge please help me to solve this...
Posted: Wed Jul 02, 2008 4:11 pm
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...
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...