DUH !!!!! With exclamation marks - the more experienced techies are meant to work on stuff that needs more experience and knowledge than on low level stuff - that is what they are payed for. Exactly like you don't use a highly experienced mathematician to solve the question of 244 x 288 !!! It would be a waste. You would use him to try to solve the following equation along with an explanation -
Read below for more on your HD problem.....
Goldbach's original conjecture (sometimes called the "ternary" Goldbach conjecture), written in a June 7, 1742 letter to Euler, states "at least it seems that every number that is greater than 2 is the sum of three primes" . Note that here Goldbach considered the number 1 to be a prime, a convention that is no longer followed. As re-expressed by Euler, an equivalent form of this conjecture (called the "strong" or "binary" Goldbach conjecture) asserts that all positive even integers can be expressed as the sum of two primes. Two primes (p, q) such that for n a positive integer are sometimes called a Goldbach partition .
According to Hardy , "It is comparatively easy to make clever guesses; indeed there are theorems, like 'Goldbach's Theorem,' which have never been proved and which any fool could have guessed." Faber and Faber offered a prize to anyone who proved Goldbach's conjecture between March 20, 2000 and March 20, 2002, but the prize went unclaimed and the conjecture remains open.
Schnirelman proved that every even number
can be written as the sum of not more than
which seems a rather far cry from a proof for two
Pogorzelski claimed to have proven the Goldbach conjecture, but his
proof is not
generally accepted . The following table summarizes bounds n
such that the strong Goldbach conjecture has
been shown to be true for numbers
The conjecture that all odd numbers are the sum of three odd primes is called the "weak" Goldbach conjecture. Vinogradov proved that every sufficiently large odd number is the sum of three primes , and Estermann proved that almost all even numbers are the sums of two primes. Vinogradov's original "sufficiently large" was subsequently reduced to by Chen and Wang . Chen also showed that all sufficiently large even numbers are the sum of a prime and the product of at most two primes .
A stronger version of the weak conjecture, namely that every odd number can be expressed as the sum of a prime plus twice a prime has been formulated by C. Eaton. This conjecture has been verified for .
Other variants of the Goldbach conjecture include the statements that every even number is the sum of two odd primes, and every integer the sum of exactly three distinct primes. Let R(n) be the number of representations of an even number n as the sum of two primes. Then the "extended" Goldbach conjecture states that
where is the twin primes constant .
An equivalent statement of the Goldbach conjecture is that for every number m, there are primes p and q such that
where is the totient function. (This follows immediately from for p prime.) Erdos and Moser have considered dropping the restriction that p and q be prime in this equation as a possibly easier way of determining if such numbers always exist .~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In the continuing quest for your HD problem - I have given you all the answers I know short of two.
But first - have you tried any of the file recovery programs such as - http://www.bitmart.net/
The other two solutions I can give you are as follows - one send the HD to me - I don't promise to solve the problem but I can sure try. The second is to send the hd to a recovery labaratory such as - http://www.recallusa.com/hd_recovery.htm
-- ~~~~~~~~~~~~~~~~~~~ TTFN – Vic / "To laugh often and much; to win the respect of intelligent people and the affection of children; to earn the appreciation of honest critics and endure the betrayal of false friends; to appreciate beauty, to find the best in others; to leave the world a little better; whether by a healthy child, a garden patch or a redeemed social condition; to know even one life has breathed easier because you have lived. ~~~~~~~~~~~~~~~~~~