[pcductape] Re: How do I stop Windows Installer?

  • From: Trapper <trapper@xxxxxxx>
  • To: pcductape@xxxxxxxxxxxxx
  • Date: Mon, 05 Apr 2004 18:53:52 -0800

Please don't tell my college math teacher that...I call and ask her all the 
time to help me with my % problems.

In this part of the country we all help each other out. Techies don't get all 
that  much pay around here...



  ----- Original Message ----- 
  From: Victor Firestone 
  To: pcductape@xxxxxxxxxxxxx 
  Sent: Monday, April 05, 2004 9:22 AM
  Subject: [pcductape] Re: How do I stop Windows Installer?


  Trapper,

  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  primes , which seems a rather far cry from a proof for two primes! 
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 . 


        bound reference 
       Desboves 1885 
       Pipping 1938 
       Stein and Stein 1965ab 
       Granville et al. 1989 
       Sinisalo 1993 
       Deshouillers et al. 1998 
       Richstein 2001 
       Oliveira e Silva (Mar. 24, 2003) 
       Oliveira e Silva (Oct. 3, 2003) 

  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


  Trapper wrote: 
    No wonder we can't get anything done or solved...you guys got it backwards. 
Why waist time with a newbie..who might take 10 minutes to find out how to 
answer your question when you got these guys who are higher up and can answer 
your question right away..Save money and time and energy that way. I figure 
that everyone at one time or another had to start at the beginning of 
things..then the graduate up the line as they get to know more..that doesn't 
mean you forget all your newbie stuff..to get to level two you still employ the 
knowlege you supposedly learned at level 1..So why not pass it on to someone 
who is still at level 0..I mean somewhere in time someone had to of passed it 
on to you( us).
    So with that said then you must have the answer for my HD problem... I am 
not sure what level the problem is at...for me its at a level way out there, 
but for you guys its probably at level 0 and not worth the time to answer, but 
could you please help me out. I would sure appreciate it....thanks!

    A level "0" newbie
      ----- Original Message ----- 
      From: Victor Firestone 
      To: pcductape@xxxxxxxxxxxxx 
      Sent: Sunday, April 04, 2004 10:38 PM
      Subject: [pcductape] Re: How do I stop Windows Installer?


      Scott,

      Actually they have to work on the assumption of "common lowest 
denomonator" and that unfortunately is "presumably ignorant" - otherwise the 
problem is escalated to the higher echelons [where people like me sit] and we 
hit the roof if a problem is thrown at us which turns out was some silly 
oversight made by someone on the way up. [Normally there are a couple of ranks 
this goes through till it gets to me]
      That is why on most tech support set-ups they have strict guidelines what 
they have to ask and what they have to run you through before the problem is 
passed on - hopefully till it is solved.
      The main reason being that they do not want the top staff to work on a 
case and then waste time going through all those "beginners" steps which are 
quite time consuming, but rather start from a certain point half way through, 
secure in the knowledge that all the "beginners" tests have already been done. 
Senior tech salaries are quite high, they mostly do other "more important" 
stuff besides solving users problems and it is also very frustrating for the 
senior techie to try to solve the problem and then find that it is something 
very minor that should have been solved a long time ago, not to mention the 
fact that many times if it is escalated to senior techies, either the techie 
has to drop what he is currently working on or the user is going to have to 
wait till the techie can stop what he is currently doing and can find time for 
him.

      Wizard@xxxxxxxx wrote:

Quoting Carl <ctm007@xxxxxxxxxxxxxx>:

  Thanks for the compliment "presumably-ignorant".    :-)
    
I meant that the tech support should not be making assumptions that the people
that they're (not) helping know what to do...

--Scott.
  ~~~~~~~~~~~~~~~~~~~

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.

~~~~~~~~~~~~~~~~~~
    

-- 
~~~~~~~~~~~~~~~~~~~

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.

~~~~~~~~~~~~~~~~~~

Attachment: gimg2151.gif
Description: GIF image

Attachment: gimg2152.gif
Description: GIF image

Attachment: gimg2153.gif
Description: GIF image

Attachment: gimg2154.gif
Description: GIF image

Attachment: gimg2155.gif
Description: GIF image

Attachment: gimg2156.gif
Description: GIF image

Attachment: gimg2157.gif
Description: GIF image

Attachment: gimg2158.gif
Description: GIF image

Attachment: gimg2159.gif
Description: GIF image

Attachment: gimg2160.gif
Description: GIF image

Attachment: gimg2161.gif
Description: GIF image

Attachment: gimg2162.gif
Description: GIF image

Attachment: gimg2163.gif
Description: GIF image

Attachment: gimg2164.gif
Description: GIF image

Attachment: gimg2165.gif
Description: GIF image

Attachment: gimg2166.gif
Description: GIF image

Attachment: gimg2167.gif
Description: GIF image

Attachment: gimg2168.gif
Description: GIF image

Attachment: gimg2169.gif
Description: GIF image

Attachment: gimg2170.gif
Description: GIF image

Attachment: gimg2171.gif
Description: GIF image

Attachment: gimg2173.gif
Description: GIF image

Attachment: gimg2174.gif
Description: GIF image

Attachment: gimg2175.gif
Description: GIF image

Attachment: gimg2031.gif
Description: GIF image

Attachment: gimg2176.gif
Description: GIF image

Other related posts: