OK, I think the only known solution is that trivial, it can be proved that
it have complexity of O(sqrt(n)),
solution
k=2
iterate {
if(k divides n) return unlucky
if(k>n) return lucky;
n=n-n/k;
k=k+1;
}
after x iteration the n will be at most n/x;
2009/1/7 Miroslav Balaz
> ok that was bullshit
Hi
Can anyone help me with question 20.4-2
and problem 20-2.
I'm on them for about an hour and I don't see the answers
Thank you
Evi
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To pos
