yesterday one of the my friends asked this Q to me prove with
correctness that
"Every even integer greater than 2 can be expressed as the sum of two
primes"
e.g
4 = 2 + 2
6 = 3 + 3
10 = 7 + 3 or 5 + 5
14 = 3 + 11 or 7 + 7
Explain & Derive The Time ,Space Complexity of Algorithm
it seems to be that we have to find all possible prime factor of
number & prints it its not big task , so by checking that number we
have to generate the all prime factor of it seems O(n) ..Hope i m
clear corrcet me if i am wrong here.??
But problem come when even number become bigger say 1 billion 10^9
so for this choosing the a number as a prime factor has probability of
1/ln(n)
so say if for 1 billion number out of 21 only 1 is prime. .y question
is we have to prove the time complexity for two
choosing a number nearby such big number is 1/ln(n)..??
with Heuristic justification it can be explained ro induction might
help but guarantee here but i need some
mathematical proof for this
Thank & Regards
Shashank Mani
CSE,BIT Mesra
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
