HDTenEightyP/NetNews huggingface dataset:
From: michaelg@Xenon.Stanford.EDU (Michael Greenwald)
Subject: Re: 1+1/2+1/3+1/4+...+1/n
Organization: CS Department, Stanford University, California, USA
Date: 19 Nov 92 17:19:27 GMT

steve@hubcap.clemson.edu ("Steve" Stevenson) writes:

>Mutter Christoph Johannes <K3032E2@ALIJKU11.BITNET> writes:

>>I've a problem. I have to calculate the sum 1+1/2+1/3+1/4+...+1/n.
>>The result should be 100.

>This problem is fraught with difficulties. This is the harmonic series so
>it does not converge.  One can expect (and you won't be disappointed)
>difficulties. A first crack is to sum the series from smallest number to
>highest (1/n ->1). That should help.

(a) Is this a homework problem?
(b) The fact that it doesn't converge doesn't make it harder; on the
contrary --- he doesn't have to check to make sure that it converges
to something less than 100.
(c) If the goal is specifically to compute it, using brute force, and
he's not using infinite precision or a rational number package, then
your hint will only help if he inspects the partial sums.  (Assuming a
naive program it will take just as long to run (i.e. "a long time"
like forever) on a Cray as on an HP calculator if he's suffering
precision problems).
(d) Also, since he's looking for the particular "n" that will allow
the harmonic series to sum to 100, it will be difficult for him to
proceed from "the smallest to the highest" without having a guess as
to what "n" is (although one would assume that someone who had taken
first year calculus might have a reasonable guess --- i.e. know the
order of magnitude of "n").

I assume you were trying to give him a hint without doing his work for
him, I just think that your hint was going to be more confusing than
helpful.  I could be wrong.

Michael Greenwald
Greenwald@cs.stanford.edu




Newsgroups: sci.math
From: mporter@nyx.cs.du.edu (Mitchell Porter)
Subject: Looking for Ralph Abraham
Organization: Nyx, Public Access Unix @ U. of Denver Math/CS dept.
Date: Sun, 22 Nov 92 07:48:49 GMT


Does anyone know if Ralph Abraham, who is a chaos theorist at UC Santa Cruz
I believe, is on the net?

Newsgroups: sci.math
From: pratt@Sunburn.Stanford.EDU (Vaughan R. Pratt)
Subject: Re: P=NP
Organization: Computer Science Department,  Stanford University.
Distribution: math
Date: Thu, 19 Nov 1992 08:02:00 GMT

In article <1992Nov18.195529.2524@math.toronto.edu> joel@math.toronto.edu (Joel Chan) writes:
>Professor E.R. Swart of the University of Guelph has written a paper
>claiming that he has resolved P=NP.  The title of one of his 3 papers
>is called
>
>"A polynomial-time procedure for resolving the graph isomorphism problem."
>
>The others are titled "N=1" and "A polynomial time solution to the
>Travelling Salesperson Problem"

Hah, we've got him now, he's got the wrong proof.  As it turns out, P=NP
because N=9 and P=0.
-- 
Vaughan Pratt	  		A fallacy is worth a thousand steps.
Newsgroups: sci.math
From: bs@gauss.mitre.org (Robert D. Silverman)
Subject: Re: 1+1/2+1/3+1/4+...+1/n
Organization: Research Computer Facility, MITRE Corporation, Bedford, MA
Date: Sat, 21 Nov 1992 12:59:10 GMT

In article <BxzMuB.6Gr@cantua.canterbury.ac.nz> jsv@math.canterbury.ac.nz (Julian Visch) writes:
:In article <HANCHE.92Nov19123151@ptolemy.ams.sunysb.edu>, hanche@ams.sunysb.edu (Harald Hanche-Olsen) writes:
:|> >>>>> On Thursday, 19 Nov 1992 13:23:29 CET, Mutter Christoph Johannes
:|> >>>>> <K3032E2@ALIJKU11.BITNET> said:
:|> 
:|> Chris> Hallo.
:|> Chris> I've a problem. I have to calculate the sum 1+1/2+1/3+1/4+...+1/n.
:|> Chris> The result should be 100. But my computer is far too slow, to solve this
:|> Chris> problem. I need the index n when the sum > 100.0
:|> Chris> And that exactly.
:|> Chris> Has anyone calculated this? (Perhaps on a CRAY|) ?
:|> 
:|> You won't find your answer by brute force on any present-day computer.
:|> Consider the fact that this sum is fairly close to log(n)+gamma for
:|> large n, where gamma is Euler's constant; it follows that the desired
:|> n is rather close to exp(100-gamma), which has the approximate value
:|> 15092688622113788323693563264538101449859497.364099... (according to
:|> Maple).  Some finesse (asymptotic analysis) is clearly called for to
:|> get the exact answer.  Hint: Estimate the area between the step
:|> function 1/[t] (where [t] is the largest integer <= t) and 1/t for t
:|> between n and infinity.
:|> 
:|> - Harald
:
:Using Maple with 1000 decimal places I found that for
:n = 15092688622113788323693563264538101449859496 the sum was just below 100
:
:i.e 
:> evalf(sum(1./n,n=1..15092688622113788323693563264538101449859496));
:99.999999999999999999999999999999999999999999942747074071711130782941148738689\
:110197701561042496005255810450666769067029302578130750912902932624408446045107\
 
stuff deleted.....

Just HOW did Maple produce this sum? How do you know it is right?
I'm not saying it is wrong, but I am suspicious. Using H_n = log(n) + gamma
+ O(1/n) [even getting many error terms via Bernoulli polynomials won't
give explicit constants on the errors],  is NOT sufficient.
--
Bob Silverman
These are my opinions and not MITRE's.
Mitre Corporation, Bedford, MA 01730
"You can lead a horse's ass to knowledge, but you can't make him think"
Newsgroups: sci.math
Subject: P=NP
From: currie@uwpg02.uwinnipeg.ca
Date: 17 NOV 92 10:31:05 CST
Organization: University of Winnipeg

Question 1: Is this the same Swart from Guelph who claimed about 5 years 
ago to have a proof that P=NP? That proof was found to be erroneous, wasn't 
it?
Question 2: What is the relation of the posting Swart to the proving Swart?
Newsgroups: sci.math
From: matmcinn@nuscc.nus.sg (Brett McInnes)
Subject: Re: Can anyone solve this problem?
Organization: National University of Singapore
X-Newsreader: Tin 1.1 PL4
Distribution: usa
Date: Mon, 23 Nov 1992 07:26:27 GMT

	No.
Newsgroups: sci.math
From: fokp@bray1b.its.rpi.edu (Ben Fok the "lemming")
Subject: Re: Most important event in the history of mathematics
Reply-To: fokp@rpi.edu
Organization: Rensselaer Polytechnic Institute, Troy, NY.
Date: Wed, 18 Nov 1992 21:11:56 GMT

How about the discovery of Chaos and Fractals?
Xref: sparky sci.math:15310 sci.philosophy.tech:4199 comp.theory:2494 sci.math.stat:2398
From: auerbach@ncsu.edu (David D Auerbach)
Subject: Re: Logic and Mathematicians (quite long)
Organization: North Carolina State University
Distribution: sci.math
Date: Sun, 15 Nov 1992 19:38:06 GMT

I won't quote this thread, which has gotten quite lengthy, and turned into
a discussion of what exactly certain logicians, chiefly Godel, showed.  I
have a few cavils with some assertions that went by.  The 2nd
Incompleteness Theorem is not a simple corollary of the 1st; if it were
Godel would have proved it in his paper.  He sketched it. Proving it is not
trivial and requires stronger assumptions than G1.  
    There is a sizable literature on whether G1, G2 or neither refute
Hilbert's Program or modified Hilbert's Programs.  For such arguments the
technical results alone do not suffice--one needs the premises that relate
such purely mathematical results to the epistemology.  The issues are not
as simple as the remarks in the thread would indicate.  (I think Hilbert's
Program *is* refuted, but it takes a longer argument than pointing at G2 ).
Finally there was a tone in the thread that Godel numbering is simply a
matter of assigning numbers 1-1 to syntactic entities and after that it is
a simple diagonal argument. Not so; there is the tender matter of showing
that sequences of *arbitrary* length can be coded  up in an elementary
manner. One of Godel's many insights was that this was what was needed and
then doing it. (In his original proof this is where the Chinese Remainder
THeorem comes in).  What is amazing about the original paper is the
surefootedness with which he covered all the bases in an area where he
basically had to invent modern standards of clarity and rigor.  
Xref: sparky sci.math:15434 comp.edu:1937
From: preece@StPaul.c10sd4.NCR.COM (Bently.Preece)
Subject: Re: Solutions to a cubic equation
Organization: NCR NPD, St. Paul, MN
Distribution: usa
Date: Tue, 17 Nov 1992 23:29:46 GMT


markd@locus.com (Mark Dubinsky) writes

    ... What is the formula for the solutions of a cubic
    equation

    x3 + ax2 + bx + c = 0    ?

sichase@csa3.lbl.gov (SCOTT I CHASE) writes:


>Eliminate the Y^2 term by suitable substitution.

    X^3 + D*X + E = 0                       (**)

    ...  The idea is to 
    use the trignometric identity:

    4*cos^3(x) - 3*cos(x) - cos(3*x) = 0.   (***)

Forget trig identities.  Try (A + B)^3 = 3AB(A + B) + (A^3 + B^3).  Now if
you can get 3AB = -D and (A^3 + B^3) = -E then A + B will be a solution.
This is easy to solve.
From: palmerp@math.orst.edu (Paul A Palmer)
Newsgroups: sci.math
Subject: Re: Rubik's Cube help?
Date: 20 Nov 92 06:10:13 GMT
Article-I.D.: phoebus.PALMERP.92Nov19221013
	<1992Oct27.040845.6440@msuinfo.cl.msu.edu>
Reply-To: Paul Palmer <palmerp@math.orst.edu>
Organization: Dept. of Math, Oregon State University
NNTP-Posting-Host: phoebus.math.orst.edu
In-reply-to: raymond@cps.msu.edu's message of 27 Oct 92 04:08:45 GMT

In article <1992Oct27.040845.6440@msuinfo.cl.msu.edu> raymond@cps.msu.edu (Carl J Raymond) writes:

     I know there's still a cube lover's mailing list, although traffic
   lately has been extremely low.  I can't remember the address offhand,
   but if you want it, I can dig it up.

Send email to Cube-Lovers-Request@AI.MIT.EDU for information on this mailing
list, or to join it.

--
Paul Palmer
Department of Mathematics     	E-mail: palmerp@math.orst.edu
Kidder Hall 368
Oregon State University, Corvallis, Oregon 97331-4605
Newsgroups: sci.math
From: cyeomans@ms.uky.edu (Charles Yeomans)
Subject: Re: Fermat's Last Theorem and the FAQ
Date: Sun, 22 Nov 1992 18:20:34 GMT
Organization: University Of Kentucky, Dept. of Math Sciences

In article <rkaivola.722428224@mits> rkaivola@mits.mdata.fi (Risto Kaivola) writes:
>I haven't seen the FAQ for weeks, and I don't know if it answers my
>question.  If it does, I apologize for the inconvenience.
>
>For even n (>= 2) it is trivial to show that there cannot be odd
>x, y such that
>
>                    (x**n) + (y**n) = (z**n).
>
>I know that FLT has been proven true for all values of the exponent
>n >=3 upto some fixed constant (quite large, I imagine).  My question
>is this:  Are there some other trivial cases like this, where we
>can easily show FLT to be true for infinitely many n?
>
Why, yes there are .  I can prove that FLT is true for all n which are
divisible by 3.  I wonder if this can be generalized.

Charles Yeomans

Newsgroups: sci.math
From: ilan@leland.Stanford.EDU (ilan vardi)
Subject: Re: Prime test algorithm
Organization: DSG, Stanford University, CA 94305, USA
Date: Sun, 22 Nov 92 21:40:59 GMT

In article <1992Nov17.163615.22479@jussieu.fr> dob@ccr-p6.ccr.jussieu.fr (Dominique BERNARDI p3512) writes:
>
>If, on the other hand, you want a rigorous proof, with
>"evidence" you can oppose to others that your number is
>indeed prime, you should take a look to ECPP (Elliptic
>Curve Prime ?) written by Francois Morain,
>available by anonymous ftp from
>ftp.inria.fr
>in directory /INRIA

A simplified version of this is available in Mathematica version 2.0

-Ilan Vardi 


Newsgroups: sci.math
From: chisnall@cosc.canterbury.ac.nz (The Technicolour Throw-up)
Subject: Re: Erdos number
Organization: Computer Science,University of Canterbury,New Zealand
Date: Thu, 19 Nov 1992 10:11:08 GMT

From article <1992Nov12.224157.23146@infodev.cam.ac.uk>, by sl25@cus.cam.ac.uk (Steve Linton):
> The definition of Erdos number clearly implies the existence of the Erdos
> graph, in which the number is simply distance from Erdos. 
> 
> 1) observe that this graph is undirected in mathematics, but directed (by
> the order of the author's names on the paper) in most sciences. Does this
> allow any interesting generalisations?

Yes.  Martin Tompa played around with such ideas (among others) in his paper
"Figures of merit", SIGACT NEWS, winter 1989, vol 20, #1, pp62-71 and in a
followup article in vol 21, #4.  He uses a modified graph in which there is a
path from a to b iff a's name occurs before b's does on a paper and then
defines the "monotonic Erdos number" to be the longest path between Erdos and
someone!  He also looks at a few other metrics.

Interesting to see the name of one of sci.math's frequent posters show up in
the tables that Tompa uses.  Apparently Vaughn Pratt's Erdos number is at
worst 4.

--
Just my two rubber ningis worth.
Name: Michael Chisnall  (chisnall@cosc.canterbury.ac.nz)
I'm not a .signature virus and nor do I play one on tv.
Will be .signature virus for food.
From: pperez@math.ucla.edu (Pablo A. Perez-Fernandez)
Newsgroups: sci.math
Subject: complex analysis question
Date: 16 Nov 92 02:39:40 GMT
Distribution: sci
Organization: Department of Mathematics, UCLA

Thanks to those who replied to my question about the analytic function
from the open unit disk to the open unit disk having two fixed points.
They were all very helpful.

I want to make it clear that this is not a homework question. My class
is using Ahlfor's book. This problem is from Lang's book which I am
using to supplement that which is covered in my class.

Once again, thanks to all who replied,

pablo
From: elkies@ramanujan.harvard.edu (Noam Elkies)
Newsgroups: sci.math
Subject: Re: exp(pi*sqrt(x))
Date: 24 Nov 92 03:00:36 GMT
Article-I.D.: husc3.1992Nov23.220037.17744
Organization: Harvard Math Department

In article <By74An.L11@comp.vuw.ac.nz>
harper@kauri.vuw.ac.nz (John Harper) writes:
>According to Maple, exp(Pi*sqrt(37))=199148647.999978 correct to 15 figures.
>This looks close to an integer to me even though 37 isn't in the list above.
>[of discriminants of quadratic imaginary fields with class number 1]
>Is there a "good" reason why it is so close?

Yes: it's trying to approximate not j(sqrt(-37)) but H2(sqrt(-37)) where
H2 parametrizes pairs of 2-isogenous elliptic curves.  Q(sqrt(-37)) does
not have unique factorization, but is "idoneal" --- the class group is
entirely accounted for by genus theory.  An even better example of this
is exp(Pi*sqrt(58))=24591257751.999999822... which I think was known
empirically to Ramanujan.

--Noam D. Elkies (elkies@zariski.harvard.edu)
  Dept. of Mathematics, Harvard University
Newsgroups: sci.math
From: charlie@umnstat.stat.umn.edu (Charles Geyer)
Subject: Re: Square root of a number
Organization: School of Statistics, University of Minnesota
Date: Sun, 22 Nov 1992 23:38:41 GMT

In article <djoyce.722465491@black.clarku.edu> djoyce@black.clarku.edu
(Dave Joyce) writes:

> One of the Old Babylonian methods was to interpolate the answer from a table
> of squares.  Another was to improve your guess by better guesses:
>
> new guess = (1/2)( old guess + (number/old guess))

The latter is, of course, Newton's method applied to the problem of
finding a zero of the function f(x) = x^2 - A.

Pretty smart of the Babylonians to have figured that out.

-- 
Charles Geyer
School of Statistics
University of Minnesota
charlie@umnstat.stat.umn.edu
Newsgroups: sci.math
From: rkinder@iat.holonet.net (Robert J. Kinder)
Subject: Re: Prime test algorithm
Organization: HoloNet (BBS: 510-704-1058)
Date: Tue, 17 Nov 1992 05:46:15 GMT

blom@husc15.harvard.edu writes:
: Does anyone have C source code for an algorithm to determine whether an
: enormous number (over 1000 decimal digits) is prime or composite?  I have
: Derive and Mathematica for my 486, but they run slowly on some of my large
: prime-test problems (546!-1) and I would like to be able to use my VAXstation
: 4000-90.  I think I may also be able to compile Fortran, and maybe Pascal.  I
: have the best luck with C programs because they are so portable.
: 
: Thanks in advance.
: --Eric Blom
:   Harvard

The best package seems to be Arjen Lenstra's arbitrary precision
arithmethic package written in C, based on what I've read.

Try anonymous FTP from cl-next2.cl.msu.edu and look for lenstra_3.c in the
BigNum directory.  The file should be about 91KB in size.  This package
has -, +, *, /, mod, primality testing, and exponentiation plus other
functions.
-- 
// rkinder@holonet.net            International Software Solutions, Inc.  -
// Robert J. Kinder, Jr.                             Boca Raton, Florida  -
//                                                        1-800-788-4774  -
// "We're having a real Ted Bundy day here." - C. Bernholtz
Newsgroups: sci.math
From: djoyce@black.clarku.edu (Dave Joyce)
Subject: jump in price of journals
Organization: Clark University (Worcester, MA)
Date: 18 Nov 92 14:05:13 GMT

We've had to cut subscriptions to journals because of the big price hike
primarily in European journals.  We just can't afford an average 25% increase.
Some are much worse.  Our two Kluwer journals, Compositio Math. and J.
Automated Reasoning, went up 65.5% and 35.1%, respectively.  North Holland
(Elsevier) journals went up an average of 30%, but Theoretical Comp. Sci. went
up 48.1% ($2679 from $1808).  Springer journals up 25% to 30%, Pergamon &
Wiley up 25% to 50%.  What do they think we're made of, gold?
 
-- 
David E. Joyce				Dept. Math. & Comp. Sci.
Internet:  djoyce@black.clarku.edu	Clark University
BITnet:    djoyce@clarku		Worcester, MA 01610-1477
Newsgroups: sci.math
From: jbaez@riesz.mit.edu (John C. Baez)
Subject: Re: A Question About Fundamental Group
Organization: MIT Department of Mathematics, Cambridge, MA
Date: Thu, 19 Nov 92 00:27:27 GMT

In article <amirishs.722059588@acf9> amirishs@acf9.nyu.edu (shaahin amiri sharifi) writes:
>Consider a bunch of infinitely many (countable) circles with a
>point in common. The radii of these circles make a sequence like
>{1/n}. What is the fundamental group of this space? Any comments
>or referenc would be so helpful!

This space is called the Hawaiian earring space.  I don't recall any
references to it - perhaps in the book Counterexamples in Topology?
Xref: sparky sci.math:15435 comp.edu:1938
From: crawford@boole.mitre.org (Randy Crawford)
Newsgroups: sci.math,comp.edu
Subject: Re: Minimum standards for math "competency"
Keywords: math competency education university college standards
Date: 23 Nov 92 21:53:55 GMT
Organization: The MITRE Corporation, McLean, VA
Originator: crawford@boole.mitre.org


 
In article <1992Nov23.140653.13522@scott.skidmore.edu>, pvonk@scott.skidmore.edu (Pierre VonKaenel) writes:
> In article <1992Nov23.021123.22797@linus.mitre.org> crawford@boole.mitre.org (Randy Crawford) writes:
> >In article <1339@kepler1.rentec.com> rjfrey@rentec.com (Robert J Frey) writes:
> >>
> >>	o	The Jobs Almanac's top 5 jobs are all mathematically based:
> >>		actuary, computer programmer, systems analyst, mathematician
> >>		and statistician.
> >
> >A greater need is anticipated for systems analysts and mathematicians than for
> >nurses or accountants?  First time I've heard that.  Sounds dubious.
> >
> 
> Yup, that's what the article states, I've seen it.

I don't doubt the accuracy of the quote, only the accuracy of the article.
Just because the book of Timothy says the Bible is the word of God doesn't
necessarily make it so.

>
> >>	o	The math scores of the top 1% of American high school students
> >>		would place them in the 50th percentile in Japan (that's not
> >>		a typo). How can we expect to compete with Japan in high tech
> >>		manufacturing?
> >
[...]

> >I'll step out on a limb here and say: RUBBISH!  Such a statement _has_ to be
> >completely wrong.  If the margin between the US and Japan were that great, we'd
> >see vast differences between us in virtually every form of technology, [...]
> 
> Perhaps you haven't visited a technical university lately. [...]
> Why a good number of them [US students] can't add
> fractions together or interpret what a percent means.  As to our
> brightest.. there are way too few of them!

I don't doubt that US students don't perform as well in math as they should, but 
when a scholarly article equates 99% here with 50% there, that is one hell of an 
assertion in itself.  This implies that the entire bell curve of US student
scores belongs in the 0-50% range in Japan.  Before we all start self-flagellating, 
why don't we ask for clarification?

What test was this, administered in both english and japanese?  SRA?  SAT? 
Do other tests reflect this level of disparity?  Was it repeated over several 
years using large samples of students?  Exactly what did it test?  Or is this 
just a magic number meant by the author to strike fear into the hearts of stout 
men (and women)?  Where oh where is Alan Bloom when we need him?

It seems to me that ready acceptance among educated americans of so improbable a 
claim may be evidence that the claim itself is true.  

To misquote two for the price of one:  "If it's in print, then however improbable, 
it _must_ be true." 


-- 

| Randy Crawford        crawford@mitre.org        The MITRE Corporation
|                                                 7525 Colshire Dr., MS Z421
| N=1 -> P=NP           703 883-7940              McLean, VA  22102
From: moshier@world.std.com (Stephen L Moshier)
Newsgroups: sci.math
Subject: Re: Gnu Multi-precision Package (GMP):
Date: 24 Nov 92 03:25:01 GMT
Organization: The World Public Access UNIX, Brookline, MA


   There are several extra precision floating point packages in netlib
(research.att.com).  Two are in the TOMS directory, and there is a
C package in netlib/cephes/qfloat that I wrote.  Also check the
directory called fp; it stands for "floating point" and may have
some items of interest.  For debugging an arithmetic, I have found
the PARANOIA test program to be invaluable.  The original paranoia
is in netlib/paranoia.  An adaptation for user-created arithmetic
subroutines is included with another test program of mine that is
on usc.edu in the /pub directory.
From: rauch@harpo.tapir.Caltech.EDU (Kevin Rauch)
Newsgroups: sci.math
Subject: Re: 1+1/2+1/3+1/4+...+1/n
Date: 20 Nov 1992 01:18:56 GMT
Organization: California Institute of Technology, Pasadena
NNTP-Posting-Host: harpo.tapir.caltech.edu

Mutter Christoph Johannes <K3032E2@ALIJKU11.BITNET> writes:

>Hallo.
>I've a problem. I have to calculate the sum 1+1/2+1/3+1/4+...+1/n.
>The result should be 100. But my computer is far too slow, to solve this
>problem. I need the index n when the sum > 100.0
>And that exactly.
>Chris. ------------


Use the identity:

    1+1/2+ ... +1/n = gamma + psi(1+n)  ,

where gamma=0.577... is the Euler gamma constant and psi(z) is the
digamma function (logarithmic derivative of the gamma function). Using
Mathematica I get the sum to be >100 for n greater than or equal to:

15092688622113788323693563264538101449859497

(about 1.5e43; the estimate ceiling(exp(100)) is off by 1, which is good enough
 all the same, I think! :)


&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&
& Kevin Rauch, Theoretical Astrophysics, California Institute of Technology  &
&  email: rauch@tapir.caltech.edu                                            &
&   "Got my sights on the stars. Won't get that far, but I'll try anyway..." &
&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&  --N. P.  &&&&&&&&& 
                                                         &&&&&&&&&&&&&
Newsgroups: sci.math
From: mroussel@alchemy.chem.utoronto.ca (Marc Roussel)
Subject: Re: Office Hours
Organization: Department of Chemistry, University of Toronto
Distribution: sci
Date: Sun, 15 Nov 1992 19:09:59 GMT

In article <1992Nov12.230809.44694@kuhub.cc.ukans.edu>
dchatterjee@kuhub.cc.ukans.edu writes:
>      Look for high GRE and 
>      Subject GRE scores.

     Useless and worse-than-useless.  The GREs are too easy and they
lend themselves to strategic exam taking.  High GRE scores (esp. subject
scores) prove nothing.  (This isn't sour grapes.  I got very high GRE
scores, but I also know how I got them.)

				Marc R. Roussel
                                mroussel@alchemy.chem.utoronto.ca