quickQuiz #1 (maths)

Factorize 25805307988219.

Also tell me your methods ( I'm curious )

Results:
Meez won the cookie!
Sweetooth used google.

I was lazy and used the linux program called factor:
user@host ~ $ factor 25805307988219
25805307988219: 1212851 21276569
Comments
41
17yo from UK. I'd bet 10 GTV Euros you are clueless on how to get the answer.
Parent
I'm a just-turned 16yo from the UK!
Parent
you cant factorize that you dumb ass cos it doesnt have any thing to seperate 2 different numbers.

:D .... nice try for journal xD
Are you the one who had no fucking clue on how to factor 2x+6 ? Don't teach me maths, please...
Parent
xD... yes i was. dont try and make journals.. please thanx

gl
Parent
your the dumbass... you can factorise it.

1212851 and 21276569
Parent
it's probably a prime or something ridiculous like that

cant be bothered
Nah... I took the time to make sure it's the product of two prime numbers. Finally someone who at least knows what he's talking about.
Parent
but didnt help u xD
Parent
anyway

the prime factors (of 25805307988219) are 1212851 and 21276569
Parent
Yep. You win the cookie :)
How did u do it?
Parent
exp ( ((64/9)b)^(1/3) * (log b)^(2/3) )
Parent
and where is the solutionway?
Parent
I'm not getting it either :<
Parent
if i get time ill explain it, kinda busy
Parent
if you thought of that instantly, you should stop watching so much stargate and do something challenging :D

hi meez btw
Parent
heh, too lazy

keep telling myself I'll put effort into programing, but I never get round to it
Parent
GNFS General Number Field Sieve ?
Parent
Suppose the number to be factored is N, and you have tested it and
found that it is composite. Pick a random start x(0) with
1 < x(0) < N. For i = 1, 2, 3, ..., compute:

x(i) = x(i-1)^2 - 1 (mod N)
x(2*i-1) = x(2*i-2)^2 - 1 (mod N)
x(2*i) = x(2*i-1)^2 - 1 (mod N)
d(i) = GCD(N, x[2*i]-x)

If d(i) = 1, increment i and repeat the computation.
If 1 < d(i) < N, then you have split N into two factors:
N = d(i)*[N/d(i)].
If d(i) = N, pick a new value of x(0) and begin the process anew.

Once you have split N into two parts, you have to test them both to
see if they are prime or composite, and repeat the process on the
composite parts.

Example: N = 1037. Pick the random start x(0) = 44.

i x(i) x(2*i) d(i)
0 44 44 --
1 898 654 61

and, sure enough, N = 61*17, and both factors are prime.

With your example N = 2211280 and the start x(0) = 12843, 5 would
appear as a factor after 1 step, 16 after 2 steps, and 211 after 13
steps, leaving 131 (which would have appeared at the 14th step).
If we instead start with x(0) = 1033994, the factor of 131 appears on
the first step, and on the second step, we get 40*422, both parts
composite.

Usually to find a factor P takes about sqrt(P) steps. We were lucky in
the first example, needing only one step. With your method, it takes
P/ln(P) steps, and luck plays no part. Pollard Rho steps are more
complicated than your divisions, however. The explanation for why this
works is not within the scope of this note, but involves some
fascinating ideas from number theory and probability theory.
no, i will not do your homework
why do u ask this? do u make it in the school or what?
Nah, no way.
I wanted to see how the community responds to a quick quiz like this. Furthermore, I was curios on the various methods people could think of.
Parent
quick quiz but not so easy, try to ask something easyer, and not something from kryptography
Parent
I could start a daily crossfire journal with quick quizzes :) I gave me a nice idea
Parent
try to solve my task i wrote i a journal!
Parent
Your problem was nicer than mine indeed. Two people solved it, not just one :)
Parent
wanna hear another task from kombinatoric?
Parent
ye, but keep it for tomorrow, 3 math journals in a row it's kinda too much... Tomorrow, 22:00 CET ?
Parent
not really i will forget :P
but if u stay here now i can wrote 1 more task for today :)
Parent
wait sec have to find one good
Parent
1+1 = A Window!
awesome splodge. truely stunning
Parent
Back to lower school 4 u!
Parent
when I tried to google it it kept bringing me back to this page!!!
Back to top