Back


Newsgroup sci.math 156252

Directory

Subject: Re: Vietmath War: need help on physics history -- From: Archimedes.Plutonium@dartmouth.edu (Archimedes Plutonium)
Subject: Re: math puzzle -- From: margot@cnwl.igs.net (David)
Subject: Re: x^2 = 2^x -- From: "T.B. Moss"
Subject: Re: Vietmath War: need help on physics history -- From: claybyrd@ix.netcom.com(Elizabeth Barrett)
Subject: Generalised Lucas-Lehmer -- From: mert0236@sable.ox.ac.uk (Thomas Womack)
Subject: Re: holiday group question -- From: Fred Galvin
Subject: Re: Eigenvalue placement problem -- From: israel@math.ubc.ca (Robert Israel)
Subject: Problem with complex exponents and roots -- From: jamth@mindspring.com (Jim Muth)
Subject: Re: Convergence of simple zeta function -- From: petry@accessone.com (David Petry)
Subject: Re: x^2 = 2^x -- From: kovarik@mcmail.cis.McMaster.CA (Zdislav V. Kovarik)
Subject: Re: Spivak's "Calculus on Manifolds" -- From: select information exchange
Subject: Loan Repayment Algorithm -- From: mlandon@bluesky.net.au (Mike LANDON)
Subject: Re: x^2 = 2^x -- From: margot@cnwl.igs.net (David)
Subject: Re: Vietmath War: Wiles looney tune -- From: Archimedes.Plutonium@dartmouth.edu (Archimedes Plutonium)
Subject: Re: Average -- From: "Robert E Sawyer"
Subject: Re: Loan Repayment Algorithm -- From: "Robert E Sawyer"
Subject: Re: comp.speech Frequently Asked Questions - part 2/3 -- From: James Salsman
Subject: Re: Shortest distance question -- From: Pertti Lounesto
Subject: off-topic-notice smncm1996354070638: 5 off-topic articles in discussion newsgroup @@sci.math -- From:
Subject: Re: "What causes inertia? -- From: Malkki Heikki
Subject: Re: Problem with complex exponents and roots -- From: Wilbert Dijkhof
Subject: Non-fully meshed networks -- From: Maurizio Macagno
Subject: Re: Why can't 1/0 be defined??? -- From: Carl Renneberg
Subject: Re: closed form soln of infinite product -- From: ptwahl@aol.com (PTWahl)
Subject: Re: x^2 = 2^x -- From: "William E. Sabin"
Subject: Re: x^2 = 2^x -- From: "William E. Sabin"
Subject: Re: Q: Solving recurrences with Mathematica -- From: nahay@pluto.njcc.com (John Nahay)
Subject: Re: What is so special about 13-14-15 triangles? -- From: nahay@pluto.njcc.com (John Nahay)
Subject: Re: Solving cubic and quartic equations -- From: ptwahl@aol.com (PTWahl)
Subject: Re: Help with recurrence relation -- From: numtheor@tiac.net (Bob Silverman)
Subject: Re: Vietmath War: war victims; blinded victims -- From: Andre Engels
Subject: Re: What is so special about 13-14-15 triangles? -- From: Monte Zerger
Subject: Re: Generalised Lucas-Lehmer -- From: numtheor@tiac.net (Bob Silverman)
Subject: Re: Loan Repayment Algorithm -- From: numtheor@tiac.net (Bob Silverman)
Subject: off-topic-notice smncm1996354122604: 6 off-topic articles in discussion newsgroup @@sci.math -- From:
Subject: Re: Vietmath War: Wiles looney tune -- From: Richard Mentock
Subject: Re: What is so special about 13-14-15 triangles? -- From: Richard Mentock
Subject: Re: Spivak's "Calculus on Manifolds" -- From: weemba@sagi.wistar.upenn.edu (Matthew P Wiener)
Subject: What Mac programs handle large integers? -- From: wdavidon@haverford.edu (Bill Davidon)
Subject: Re: Vietmath War: need help on physics history -- From: Richard Mentock

Articles

Subject: Re: Vietmath War: need help on physics history
From: Archimedes.Plutonium@dartmouth.edu (Archimedes Plutonium)
Date: 20 Dec 1996 04:28:39 GMT
In article <32B9BC0A.63A3@mindspring.com>
Richard Mentock  writes:
> What about the old trisection of angle using compass and straightedge?
> That was long considered impossible, and was proven impossible in the
> nineteenth century.  However, if you change the rules just a little bit
> (allow the solver to mark on the straightedge, or even to have had a 
> mark on the straightedge), then the problem is solvable.  
The purpose of analogies is to devise them to help you think. Not to
turn the switch off. For every 1 helpful analogy, a person can dream up
an infinity of useless analogies. But I am talking to deaf and dumb
ears here, can you read lips?
> 
> That's what happens with FLT and the p-adics.  Now, the bigger question,
> whether the p-adics are or should be the set of numbers that we use to
> view the world, seems to be a question in the domain of physics or
> metaphysics.
  You use in wasting anymore of my time on you. You sound like a blue
collar worker who is faking to be a learned intellectual. Dumbo, your
above implies you believe that mathematics is utterly distinct from
physics. And you probably even think there are three distinct subjects
of math, physics and metaphysics. But you are not alone, for the
majority of people think that these subjects are distinct. I myself
realize that all subjects are somewhere inside of physics, everything,
from poetry to biology to physics itself. And there ain't no thing as
metaphysics. And your precious mathematics is just a subdepartment of
physics.
  I don't write this reply for your edification Mentock, I write it for
everyone except you. I want you to stay in the weeds.
Return to Top
Subject: Re: math puzzle
From: margot@cnwl.igs.net (David)
Date: Fri, 20 Dec 1996 05:17:22 GMT
"David R. McCoy"  wrote:
>Hi everyone!
>When I was in high school, an instructor gave the class a mathematical
>type puzzle to solve. This puzzle was about a baseball team. We were
Contact "GAMES" magazine.  They supply a lot of that type of puzzle,
and might likely know the source.
Return to Top
Subject: Re: x^2 = 2^x
From: "T.B. Moss"
Date: 20 Dec 1996 03:58:51 GMT
This one is quickly solved with a direct application of one of the basic
laws of logarithms:
	log a^b = b, for any number b
        a
Now, to solve your equation, simply use a logarithmic base of 2 and apply
to the left side:
	log x^2 = 2
        2
Therefore
	log 2^x = 2
	   2
Review the logarithmic functions for a complete understanding.  I hope this
helps.
Watcharapan Suwansuntisuk  wrote in article
<59csk0$hos@news2.cpc.ku.ac.th>...
> Do you know how to solve this equation?
> 
>                  X^2   =  2^X
> 
> If you know , post it or tell me( ioiwcs@nontri.ku.ac.th )
> 
Return to Top
Subject: Re: Vietmath War: need help on physics history
From: claybyrd@ix.netcom.com(Elizabeth Barrett)
Date: 20 Dec 1996 05:39:20 GMT
In <59d4ln$q2e@dartvax.dartmouth.edu>
Archimedes.Plutonium@dartmouth.edu (Archimedes Plutonium) writes: 
>
>In article <32B9BC0A.63A3@mindspring.com>
>Richard Mentock  writes:
>[snipers]
>I am talking to deaf and dumb
>ears here, can you read lips?
>  You use in wasting anymore of my time on you. You sound like a blue
>collar worker who is faking to be a learned intellectual. Dumbo
>I myself realize 
>everyone except you. I want you to stay in the weeds.
Pretty funny Archimedes, if you snip between the lines...
Return to Top
Subject: Generalised Lucas-Lehmer
From: mert0236@sable.ox.ac.uk (Thomas Womack)
Date: 19 Dec 1996 18:24:15 GMT
Does anyone know if there's an algorithm like the Lucas-Lehmer one
for finding prime repunits in other bases? I don't understand how
Lucas-Lehmer works (I've got Hardy and Wright, I'll look up the proofs,
but they don't look easy to extend), so I'm not sure if this is 
even a reasonable question.
--
Tom
The Eternal Union of Soviet Republics lasted seven times longer than
the Thousand Year Reich
Return to Top
Subject: Re: holiday group question
From: Fred Galvin
Date: Thu, 19 Dec 1996 22:37:02 -0600
On Thu, 19 Dec 1996, Fred Galvin wrote:
> On 18 Dec 1996, Arturo Magidin wrote:
> 
> > Aren't these HNN (Higman-Neumann-Neumann) Extensions? I seem to
> > remember one can prove even more: Given a group H, and two positive
> > integers n,m; with the proviso that n>1 and m>2, you can embed H into
> > a 2-generated group G, whose generators have exponent n and m
> > respectively.
> 
> Yes, see F. Levin, Factor groups of the modular group, J. London Math. 
> Soc. 43 (1968), 195-203.
Of course, the group H has to be *countable*.
Return to Top
Subject: Re: Eigenvalue placement problem
From: israel@math.ubc.ca (Robert Israel)
Date: 20 Dec 1996 00:01:18 GMT
In article <32B9328B.6349@usa.net>, Erwin Morales  writes:
|> Does anybody know how to find the matrix G such that the eigenvalues
|> of [(I + BG)^(-1) A] are in specific locations on the complex plane?
|> The matrices A and B are given and I is the identity matrix.
|> In control theory, finding G such that the eigenvalues of [A + BG] are
|> specified is a standard problem. But how about if the matrix in
|> question is [(I + BG)^(-1) A]?
Well, if A is invertible the inverse of (I+BG)^(-1) A is A^(-1)(I + BG), 
and the eigenvalues of M^(-1) are the reciprocals of the eigenvalues of 
M.  So that reduces your problem to the "standard" one.  I don't know
if there's an easy solution in the case where A is not invertible
(but maybe you could take the limit as s -> 0 of the solution with
A replaced by A+sI).
Robert Israel                            israel@math.ubc.ca
Department of Mathematics             (604) 822-3629
University of British Columbia            fax 822-6074
Vancouver, BC, Canada V6T 1Y4
Return to Top
Subject: Problem with complex exponents and roots
From: jamth@mindspring.com (Jim Muth)
Date: Fri, 20 Dec 1996 04:50:06 GMT
I was recently asked whether the expression (X^x)^(1/x)=X is true 
when X is a complex number.  I could not give a definite answer, 
and I am still puzzled.
I suspect that the expression is indeterminate, but I am still not 
confident enough to state it.  I would appreciate it if someone 
could answer this problem and show how it can be proved.
I thank you.
Jim Muth
jamth@mindspring.com
Return to Top
Subject: Re: Convergence of simple zeta function
From: petry@accessone.com (David Petry)
Date: Fri, 20 Dec 1996 05:35:44 GMT
jms4@po.CWRU.Edu (James M. Sohr) wrote:
>   In his lecture, he proved that the simple zeta function
>        1     1     1     1     1
>  z(2)=--- + --- + --- + --- + --- + ...
>        1     4     9     16    25
>    converges to (Pi^2)/6.  However, my memory being as it--
>I've forgotten how the proof (it really wasn't a _proof_,
>as much as a demonstration of why it was true).  Anyone
>out there recall seeing it?
Here's a simple proof of this formula that requires little more than
high school math and a little handwaving in taking a limit.  Just 
consider the limit as N goes to infinity of the formula:
sum(0 a  as N -> oo  )
The formula can be easily proven by noting that  sin(N*arcsin(x))
is a polynomial for odd N, and factoring the polynomial.
Return to Top
Subject: Re: x^2 = 2^x
From: kovarik@mcmail.cis.McMaster.CA (Zdislav V. Kovarik)
Date: 19 Dec 1996 22:02:18 -0500
In article <01bbedf4$f0f34ae0$ca61e426@dcorbit.solutionsiq.com>,
Dann Corbit  wrote:
:Newton's method gives:
:  -7.66664695962123093204e-1
:For the interesting root.
:
:William E. Sabin  wrote in article
:<32B996F6.6B12@crpl.cedar-rapids.lib.ia.us>...
:> Watcharapan Suwansuntisuk wrote:
:> > 
:> > Do you know how to solve this equation?
:> > 
:> >                  X^2   =  2^X
:> > 
:> > If you know , post it or tell me( ioiwcs@nontri.ku.ac.th )
:> 
:> Graphical solution: x = -.767 or +2 or +4
Finishing touch ("what if the graphical solution missed an 
intersection?"): Why are there no more than three real solutions?
 Hint: Suppose there are four or more real roots of 2^x-x^2 ; use Rolle's 
Theorem as many times as needed.
Cheers, ZVK (Slavek).
Return to Top
Subject: Re: Spivak's "Calculus on Manifolds"
From: select information exchange
Date: 20 Dec 1996 06:46:40 GMT
jjtom4@$IMAPSERVER wrote:
: I learn better and am motivated to work harder when the material is 
: difficult and not watered down).  Thanks.
You may be a future fields medalist, but I can't reccomend the book.  It's
a great book if you know the stuff or if someone will guide you and
explain the proofs.  However if you want some basic analysis check out
Rudin's Principles of Mathematical Analysis.  This book is a classic and
readable.  A good supplement might be Buck's Advanced Calculus.  Spivak's
book seems very slick and unmotivated.  You may need someone to fill in
the gaps.  If you already know Rudin, then you will follow Spivak.  A next
book might then be Folland's Real Analysis or Royden's Real Analysis.
Both have diferent approaches but are great in their own way.  If you need
any other advice, e-mail me.
Return to Top
Subject: Loan Repayment Algorithm
From: mlandon@bluesky.net.au (Mike LANDON)
Date: 20 Dec 1996 07:01:14 GMT
Hi there,
I am after an algorithm which will calculate the repayments on a loan
given:
Interest Rate
Number of repayments
Loan amount
etc
Can anybody help.
I am aware of tools which are available that will do this sort of
calculation for me. 
My intent is to write my own. 
Is there a mathematical model which will calculate this problem?
Thanks.
Return to Top
Subject: Re: x^2 = 2^x
From: margot@cnwl.igs.net (David)
Date: Fri, 20 Dec 1996 08:18:28 GMT
ioiwcs@nontri.ku.ac.th (Watcharapan Suwansuntisuk) wrote:
>Do you know how to solve this equation?
>                 X^2   =  2^X
>If you know , post it or tell me( ioiwcs@nontri.ku.ac.th )
2log(x) = xlog(2)
log(x)/x = log(2)/2)
There is only one value of log x for each x, so
x = 2
Return to Top
Subject: Re: Vietmath War: Wiles looney tune
From: Archimedes.Plutonium@dartmouth.edu (Archimedes Plutonium)
Date: 20 Dec 1996 06:29:24 GMT
In article 
jpb@iris8.msi.com (Jan Bielawski) writes:
> No.  It asks for ...0000xyz.
> 
> < And the p-adics are not a set separable between ...000abc and ....xyz.
> 
> What does it mean "not separable"?  Are you saying that it in
> principle makes no sense to say something like: "Let  x  be equal
> to  ...00005"??  If one *can* say something like this then one *can*
> ask questions about such numbers, like Fermat did.
I asked you a question in that last post and you did not answer it, but
snipped it. So, I will ask you until you do answer it.
  Is Quantum Mechanics a redefining of Newtonian Mechanics *in your
eyes or in your mind* ?
(hee, hee hee....)
Return to Top
Subject: Re: Average
From: "Robert E Sawyer"
Date: 20 Dec 1996 07:32:22 GMT
"Average", at least as it's used in the US, is a term for any of a wide 
variety of measures of location, including mode, median, and any of the
various means (arithmetic, harmonic, geometric, etc). 
(This is both a "dictionary definition" and accepted statistical usage.)
-- 
Robert E Sawyer 
soen@pacbell.net
Steven Johnson  wrote in article <01bbeded$439b3da0$894277a1@pc66-137.state.ut.us>...
| Is an average always a mean in mathamatical terms. Or can a average be a
| median or a mode.
Return to Top
Subject: Re: Loan Repayment Algorithm
From: "Robert E Sawyer"
Date: 20 Dec 1996 07:59:48 GMT
You might check the sci.math FAQ at
http://daisy.uwaterloo.ca/~alopez-o/math-faq/
and for loan repayment, etc, specifically
http://daisy.uwaterloo.ca/~alopez-o/math-faq/node43.html#SECTION001140000000000000000
-- 
Robert E Sawyer 
soen@pacbell.net
Mike LANDON  wrote in article <59ddjq$sie@inferno.mpx.com.au>...
| Hi there,
| 
| I am after an algorithm which will calculate the repayments on a loan
| given:
| 
| Interest Rate
| Number of repayments
| Loan amount
| etc
| 
| Can anybody help.
| 
| I am aware of tools which are available that will do this sort of
| calculation for me. 
| My intent is to write my own. 
| 
| Is there a mathematical model which will calculate this problem?
| 
| Thanks.
| 
| 
Return to Top
Subject: Re: comp.speech Frequently Asked Questions - part 2/3
From: James Salsman
Date: 20 Dec 1996 07:58:25 GMT
Jonathan Thompson  wrote:
>
> ...You mean to say that a scaling factor has been added to 
> the definition of the cepstrum for the sake of military secrets.
No, I mean to say that the cepstrum was redefined for the 
sake of military secrets.  What makes you say that the 
difference between DFT(log|DFT(.)|) and IDFT(log|DFT(.)|) 
is a scaling factor?
> I think you'll probably find that the reason for all subsequent 
> references to to the cepstrum using an IDFT instead of a DFT is 
> because the original paper was wrong.
How can the original use of a novel term be wrong?  I've been 
studying this topic for over a year, and I have no doubt that the 
Schafer-Oppenheim cepstrum is very nearly the identity; it's only 
a slight convolution.  If you would read Appendix 2 of the 
Bogert, Healy, and Tukey paper, it will be quite clear that their 
definition is rock-solid.
>  ... far more plausible than some conspiracy theory.
What's implausable about a government at war (c. 1970) and with 
much earlier levels of encryption technology wanting to protect 
cockpit and other high-noise-environment voice radio encryption 
schemes from automated attacks which require a way to determine 
when the plaintext speech has been recovered?
Could it be that H-P, one of the founders of which was 
Secretary of Defense in that era, might have been involved?
See 37 USCFR 5.2, http://www.kuesterlaw.com/lawrule/rules9.htm#52
Sincerely,
:James Salsman
Return to Top
Subject: Re: Shortest distance question
From: Pertti Lounesto
Date: 19 Dec 1996 12:32:55 +0200
The functions y=exp(x) and y=log(x) are inverses of each other, so their
graphs are symmetric with respect to the line y=x, so the shortest line
segment connecting the two graphs is perpendicular to the line y=x, so
the slope/derivateive of the functions at the end-points of the line
segment equals 1, so the end points are (0,1) and (1,0).
-- 
   Pertti Lounesto                Pertti.Lounesto@hut.fi
Return to Top
Subject: off-topic-notice smncm1996354070638: 5 off-topic articles in discussion newsgroup @@sci.math
From:
Date: Fri, 20 Dec 1996 07:06:38 GMT
-----BEGIN PGP SIGNED MESSAGE-----
These articles appeared to be off-topic to the 'bot, who posts these notices as
a convenience to the Usenet readers, who may choose to mark these articles as
"already read". You can find the software to process these notices with some
newsreaders at CancelMoose's[tm] WWW site: http://www.cm.org.
Poster breakdown, culled from the From: headers, with byte counts:
  5 12504  Archimedes.Plutonium@dartmouth.edu (Archimedes Plutonium)
    12504 bytes total. Your size may vary due to header differences.
The 'bot does not e-mail these posters and is not affiliated with the several
people who choose to do so.
@@BEGIN NCM HEADERS
Version: 0.93
Issuer: sci.math-NoCeMbot@bwalk.dm.com
Type: off-topic
Newsgroup: sci.math
Action: hide
Count: 5
Notice-ID: smncm1996354070638
@@BEGIN NCM BODY
<597mae$t46@dartvax.dartmouth.edu>	sci.logic
	sci.physics
	sci.math
<597mrg$t46@dartvax.dartmouth.edu>	sci.logic
	sci.physics
	sci.math
<597q1g$r5o@dartvax.dartmouth.edu>	sci.bio.misc
	sci.math
	sci.chem
	sci.physics
<597qht$r5o@dartvax.dartmouth.edu>	sci.math
<59d4ln$q2e@dartvax.dartmouth.edu>	sci.math
	sci.chem
	sci.physics
@@END NCM BODY
Feel free to e-mail the 'bot for a copy of its PGP public key or to comment on
its criteria for finding off-topic articles. All e-mail will be read by humans.
-----BEGIN PGP SIGNATURE-----
Version: 2.6
iQCVAwUBMro7ADLKBVWUZJPVAQFp+AQAzFe7ow3M/LfLoTljNu1hdk9ZPL/ePRPL
dZ4qSG4Sv3n85EjujKl73V7UcvRmeXYgurhhNN4Zi4zm2zj394wnwaOkMBlzeSrE
ruYvs0bP+cw7Bo181o1/YG3XtJZMr2qRHPUIqY6Wvi+gFo/jSSvb85gs+Q896UKt
mZUJoXj8O3I=
=E/+4
-----END PGP SIGNATURE-----
Return to Top
Subject: Re: "What causes inertia?
From: Malkki Heikki
Date: Fri, 20 Dec 1996 11:11:13 -0800
Louis Savain wrote:
> 
> In article <595qri$j05$1@learnet.freenet.hut.fi>,
> haporopu@mail.freenet.hut.fi (Hannu Poropudas,Oulu Suomi) wrote:
> 
> >
> >I would like to ask  Louis Savain one question.
> >I refer here to his "Re: What causes inertia", which was dated
> >Sat Dec 14  03:52:34  1996.
> >
> >
> >How does the definition of electron'  s mass as follows:
> >
> >Electron's mass is only due expansion resistance of the Universe
> >
> >fit to your descriptions in your article.?
> 
>   Sorry.  I've heard this definition of an electron's mass before but
> I'm sorry to say that it makes no sense to me.  Enlighten me.
> 
> Best regards,
> 
> Louis Savain
Geometry of the Universe could be coordinated with aid of almost
instantaneous color electricity signals and mass changes that
color electricity to black color electricity (= no color electricity).
See README.see, README.mid, README.all and drawings of H-M in
http://www.funet.fi/pub/doc/misc/HannuPoropudas
Best Regards,
Hannu Poropudas.
Return to Top
Subject: Re: Problem with complex exponents and roots
From: Wilbert Dijkhof
Date: Fri, 20 Dec 1996 11:08:18 +0000
Jim Muth wrote:
> 
> I was recently asked whether the expression (X^x)^(1/x)=X is true
> when X is a complex number.  I could not give a definite answer,
> and I am still puzzled.
No, the function a^(1/n) with n natural is multivalued.
Example: (1^2)^(1/2) = 1^(1/2) = +/-1 <> 1.
So it even doesn't hold when X is natural.
> I suspect that the expression is indeterminate, but I am still not
> confident enough to state it.  I would appreciate it if someone
> could answer this problem and show how it can be proved.
> 
> I thank you.
> 
> Jim Muth
> jamth@mindspring.com
Wilbert Dijkhof
Return to Top
Subject: Non-fully meshed networks
From: Maurizio Macagno
Date: Fri, 20 Dec 96 12:34:41 GMT
Hi everybody.
I have a generic graph representing a network.
Suppose a graph like this:
  0       1       4
  O-------O       O
  |\             /|
  | \____   ____/ |
  |      \ /      |
  O-------O-------O
  2       3       5
The graph is not fully meshed. I need an algorithm that gets out all
fully meshed subgraph.
In this case, for example, it would be get out (0 2 3) and (3 4 5).
Have you any idea ?
Thanx in advance, and excluse me for bad English.
Bye.
Mac.
--------------------------------------------------------------
Maurizio Macagno 
Centro Studi e Laboratori Telecomunicazioni
PG/P - Ingegneria del Traffico
e-mail:	Maurizio.Macagno@cselt.stet.it
        master3@spavalda.polito.it
Tel.: 	++39-11-2286754
Fax.:	++39-11-2286862
--------------------------------------------------------------
Return to Top
Subject: Re: Why can't 1/0 be defined???
From: Carl Renneberg
Date: Fri, 20 Dec 1996 21:31:07 +1100
Travis Kidd wrote:
> 
> ...
> So yes, in order to include infinity you will have to make adjustments
> to the "usual" rules of mathematics.
Or else look up a treatment of Cantor's transfinite arithmetic in a text
book.
Carl.
Return to Top
Subject: Re: closed form soln of infinite product
From: ptwahl@aol.com (PTWahl)
Date: 20 Dec 1996 10:25:44 GMT
It is interesting to note that your question was asked
around 400 years ago by Johann Kepler ( the polymath
and astronomer. )  In the 1596 tome called Mysterium
Cosmographicum, Kepler considered a geometric form
of your question.  Take an outer circle, then inscribe a
triangle, then inscribe a circle in the triangle, then a
square in that circle, another circle, a pentagon, and
repeat forever.  Is there an innermost limiting circle?
The answer is yes, and the ratio of the radii of the two is
your number 0.11494 ...  The calculation was beyond
Kepler, but he was first to note that the limit existed and
was greater than zero.
Kepler was seeking a geometric reason why his perfect
deity had chosen the ratios of the "crystalline spheres"
that held the orbits of known planets:  Saturn, Jupiter,
Mars, Earth, Venus and Mercury.  He later chose to nest,
not polygons, but polyhedrons, and obtained remarkably
good results.  ( You may have seen his drawing, which
shows up in many Humanities texts. )  But I digress.
Because this is the fourth centennial of Kepler's great
work, I had hoped to write an article about all this.  The
capstone would have been the closed-form solution you
seek.  I failed.  There is a rapidly-convergent expression
( in terms of Riemann's zeta function at even integers )
which is handy for computation.  You may have noted
how slowly the original product converges!
Sinai Robins ( now at U.C.San Diego ) has turned my
result into some Fourier convolution integrals, and he
believes the integrals are "do-able" but we poured down
many pots of coffee together and finally gave up.
If you're not bored yet, here are the results.  Let L be
the desired limit.  Let its inverse be R = 8.7000366 ...
and M = ln ( R ).  Use Z to denote the zeta function.
Now, M = ln( 11264 / ( 525 Pi )) + T
and, T = SUM{ n=1 ... infinity} of these terms:
( 2^(2n) - 1 ) [ Z(2n) - 1 - 2^(-2n) - 3^(-2n) ]^2  /  n .
My notes say that the original product converged to 
give 15 correct digits in about 300,000,000 terms.
The infinite sum I call T provides equal precision in just
eight terms.  By the way, the exponential of T is a 
pretty-looking doubly-infinite product:  where m and n
each vary from 4 to infinity, multiply these terms:
[ ( mn - 1 ) ( mn + 1 ) ]  /  [ ( mn - 2 ) ( mn + 2 ) ] .
Further note:  Richard K. Guy keeps a list of open
problems called "Western Number Theory Problems"
and this is number 91:24 on the list.  ( # 24 from the
1991 conference. )  I presented the above at the 1993
conference, but haven't been back to see if anyone
beat my best effort.
Patrick T. Wahl
( no institutional affiliation )
"... the triangle is the first figure in geometry.  Immediately
I tried to inscribe into the next interval between Jupiter and
Mars a square, between Mars and Earth a pentagon,
between Earth and Venus a hexagon ..."  --  Johann Kepler
Return to Top
Subject: Re: x^2 = 2^x
From: "William E. Sabin"
Date: Fri, 20 Dec 1996 05:12:52 -0800
Dann Corbit wrote:
> 
> Newton's method gives:
>   -7.66664695962123093204e-1
> For the interesting root.
> > Graphical solution: x = -.767 or +2 or +4
Aren't the +2 and +4 roots also interesting real roots? Wouldn't Newton 
method also converge to these values, with the right initial guess? The 
local mimimum and local maximum of this plot are interesting also.
Bill W0IYH
Return to Top
Subject: Re: x^2 = 2^x
From: "William E. Sabin"
Date: Fri, 20 Dec 1996 05:08:06 -0800
Zdislav V. Kovarik wrote:
> 
> :William E. Sabin  wrote in article
> :<32B996F6.6B12@crpl.cedar-rapids.lib.ia.us>...
> :> Graphical solution: x = -.767 or +2 or +4
> 
> Finishing touch ("what if the graphical solution missed an
> intersection?"): Why are there no more than three real solutions?
>  Hint: Suppose there are four or more real roots of 2^x-x^2 ; use Rolle's
> Theorem as many times as needed.
Using a Mathcad graphical method, I could not find more than 3 real 
zero-crossings.  Above +4 and below -.76 the plot "takes off". But 
apparently there are many complex solutions.
Bill W0IYH
Return to Top
Subject: Re: Q: Solving recurrences with Mathematica
From: nahay@pluto.njcc.com (John Nahay)
Date: 20 Dec 1996 11:16:05 GMT
ahesham@batelco.com.bh wrote:
: Does anyone know of a way to solve a recurrence with two
: variables using Mathematica or other programs.
Rewrite your recurrence as a matrix equation.  For two variables,
this should be an infinite matrix, indexed by a 2-tuple for columns
and a 2-tuple for rows.  One must invert the upper block of this
matrix of size, n, for each n.    I am doing just such a thing 
right now (actually, I am trying to FIND a finite recursion, given
the INFINITE number of equations it satisfies).
Return to Top
Subject: Re: What is so special about 13-14-15 triangles?
From: nahay@pluto.njcc.com (John Nahay)
Date: 20 Dec 1996 11:12:06 GMT
David (margot@cnwl.igs.net) wrote:
: >across the words "famous 13-14-15 triangle" several times.  I had never
Does it have an area which is rational (modulo sqrt(2)) or integral?
Return to Top
Subject: Re: Solving cubic and quartic equations
From: ptwahl@aol.com (PTWahl)
Date: 20 Dec 1996 11:25:05 GMT
I don't know what you'd find on the Internet.  The methods are
arcane and not very pretty.   I studied this in the pre-calculator
days ( late sixties ) when numerical approximations were
expensive and algebra was cheap ( kind of the reverse of the
world today. )
For the cubic, pick up an old "CRC Handbook of Chemistry and
Physics."  Mine is the 38th edition ... look for one of the old
editions that really fit in one hand.  Check the table of contents
in the Math Formulas section.  They don't get lost in theory and 
just say how to do it.
For both the cubic and the biquadratic ( old word for quartic ), 
most libraries ought to have the 1948 classic by J.V. Uspensky
called "Theory of Equations."  This was the standard reference
for about thirty years, and is still useful despite the emphasis on
arithmetic and on looking up results in tables.  Uspensky writes
at a high-school algebra level ( a little trigonometry, but you can
skip that part ) and devotes Chapter 5 to your subject.  Worked
examples are included.
Don't expect to find a "formula" like we have for the quadratic
equation.  I suppose you could write it that way, but in the real
world it's done step-by-step to avoid having cube roots of sums
of square roots and messy stuff like that.
Patrick T. Wahl
( no institutional affiliation )  
Return to Top
Subject: Re: Help with recurrence relation
From: numtheor@tiac.net (Bob Silverman)
Date: Fri, 20 Dec 1996 15:09:30 GMT
mab@dst17.wdl.loral.com (Mark A Biggar) wrote:
>What is the genreal closed form solution for the recurrence relation:
>X(n+1) = a*X(n) + b;
>This is not homework and I just can't find the right book and I don't
>remember the trick.
Let   alpha,Beta be the two roots   of   x^2 - ax - b = 0.
Then  X(n) =  c1 alpha^n + c2 Beta^n,    where c1,c2 are given
by the initial conditions.
Return to Top
Subject: Re: Vietmath War: war victims; blinded victims
From: Andre Engels
Date: 20 Dec 1996 11:38:21 GMT
Archimedes.Plutonium@dartmouth.edu (Archimedes Plutonium) wrote:
>In article <598ml5$am5@svin12.win.tue.nl>
>Andre Engels  writes:
>
>> No, it's not. You may say ....5555 is an integer (I won't stop you), but
>> then your concept of integer is not the one that FLT is talking about.
>
> Define "finite" for finite integers. Math is the science of precision.
>If you cannot define finite without a componentry of infinity. Then
>finite integer does not exist.
>
Why not? As long as I can define them in ANY way, they exist, IMO.
My first attempt of defining them would be Peano's axioms, but, as Godel
showed, this defines an infinite number of different systems, so we can't
really use it. So I go for this one:
A number is an integer if and only if it is a member of some finite set,
all of whose members are either 0, or such that they are n+1 for some
number n in the set. I here use Dedekind's of finite: A set S is finite if
and only if it cannot be put in a 1-to-1 correspondence to a strict subset
of S.
> Who cares about the properties of ether when ether does not exist. 
>
> Who cares about the behavior of the Higgs boson when the Higgs does
>not exist.
>
> Who cares about FLT and whether finite integers have a solution, when
>Finite Integers do not exist.
>
>  You guys are poor at mathematical reasoning, but poorer still at
>understanding what I write.
I'm sorry, I think you made a typo here, you must have meant:
"I am poor at mathematical reasoning, but poorer still are you at
 understanding what I write."
>I think this is because you do not know
>math well enough to see the full issues here.
Can't it be that instead of all mathematicians of the world, it is perhaps
you that doesn't understand math enough?
>But, it is to your credit
>that you are stupid enough to attack anyone who says something that is
>not printed in one of your textbooks. Congratulations.
No, we don't attack anyone who says something that is not printed in one
of our textbooks. But we do attack someone who repeatedly asserts such
things without proving them in anything like the correct way and calls us
stupid. We attack those, yes.
Andre Engels
Return to Top
Subject: Re: What is so special about 13-14-15 triangles?
From: Monte Zerger
Date: 20 Dec 1996 12:06:52 GMT
One thing special about it is that is the only triangle to which 
successive integers can be assigned to its sides and altitude.  
-- 
Monte J. Zerger                   Mathematics Department 
Voice: 719 589-7546               Adams State College  
Fax:    719 589-7522              Alamosa, CO 81102
Return to Top
Subject: Re: Generalised Lucas-Lehmer
From: numtheor@tiac.net (Bob Silverman)
Date: Fri, 20 Dec 1996 15:07:17 GMT
mert0236@sable.ox.ac.uk (Thomas Womack) wrote:
>Does anyone know if there's an algorithm like the Lucas-Lehmer one
>for finding prime repunits in other bases? I don't understand how
>Lucas-Lehmer works (I've got Hardy and Wright, I'll look up the proofs,
>but they don't look easy to extend), so I'm not sure if this is 
>even a reasonable question.
Noone knows, but I doubt whether they exist.  What makes Lucas-Lehmer work
for base 2    is that for  N = 2^p-1,   we have N+1 fully factored.   N+1
happens to be the order of the twisted (sub) group of a finite field.
For base 10, we have N = (10^n-1)/9,   and 9N+1 is fully factored.  The problem
is to find a group whose order is (a priori) 9N+1.  I don't know of any and
noone else does either. (Which is not to say that they don't exist).  On the
other hand groups are known whose order is given by any cyclotomic 
polynomial in N.  9N+1 is not one of them....
Return to Top
Subject: Re: Loan Repayment Algorithm
From: numtheor@tiac.net (Bob Silverman)
Date: Fri, 20 Dec 1996 15:14:34 GMT
mlandon@bluesky.net.au (Mike LANDON) wrote:
>Hi there,
>I am after an algorithm which will calculate the repayments on a loan
>given:
>Interest Rate
>Number of repayments
>Loan amount
>etc
Hint: Write down the payments as a geometric series.  Then sum the series.
Return to Top
Subject: off-topic-notice smncm1996354122604: 6 off-topic articles in discussion newsgroup @@sci.math
From:
Date: Fri, 20 Dec 1996 12:26:04 GMT
-----BEGIN PGP SIGNED MESSAGE-----
These articles appeared to be off-topic to the 'bot, who posts these notices as
a convenience to the Usenet readers, who may choose to mark these articles as
"already read". You can find the software to process these notices with some
newsreaders at CancelMoose's[tm] WWW site: http://www.cm.org.
Poster breakdown, culled from the From: headers, with byte counts:
  6 18588  Archimedes.Plutonium@dartmouth.edu (Archimedes Plutonium)
    18588 bytes total. Your size may vary due to header differences.
The 'bot does not e-mail these posters and is not affiliated with the several
people who choose to do so.
@@BEGIN NCM HEADERS
Version: 0.93
Issuer: sci.math-NoCeMbot@bwalk.dm.com
Type: off-topic
Newsgroup: sci.math
Action: hide
Count: 6
Notice-ID: smncm1996354122604
@@BEGIN NCM BODY
<59af4b$3pn@dartvax.dartmouth.edu>	sci.logic
	sci.physics
	sci.math
<59ag70$ok2@dartvax.dartmouth.edu>	sci.logic
	sci.physics
	sci.math
<59ahm8$2ar@dartvax.dartmouth.edu>	sci.logic
	sci.physics
	sci.math
<59aghc$ok2@dartvax.dartmouth.edu>	sci.logic
	sci.physics
	sci.math
<59ajar$14m@dartvax.dartmouth.edu>	sci.logic
	sci.physics
	sci.math
<59alsp$l5r@dartvax.dartmouth.edu>	sci.logic
	sci.physics
	sci.math
@@END NCM BODY
Feel free to e-mail the 'bot for a copy of its PGP public key or to comment on
its criteria for finding off-topic articles. All e-mail will be read by humans.
-----BEGIN PGP SIGNATURE-----
Version: 2.6
iQCVAwUBMrqF3jLKBVWUZJPVAQEHJwQA4cT3OX2p/wWH8daM96yNJl8OgW2VIXKq
yJ5HRDoIrYhtmkEFJQ458peJmzmz5IOrP80j7J8IVhjTh4O7uhehS+pRNaQn2TuZ
SKl5nxtynfsHxv9z6TYfuopV8uEIg9U0gRJ9JV6AiKzitFhSRDVDkeFSzJog+7Mc
H0UEuaMLVTU=
=J7pk
-----END PGP SIGNATURE-----
Return to Top
Subject: Re: Vietmath War: Wiles looney tune
From: Richard Mentock
Date: Fri, 20 Dec 1996 09:23:13 -0500
Archimedes Plutonium wrote:
> I asked you a question in that last post and you did not answer it, but
> snipped it. So, I will ask you until you do answer it.
> 
>   Is Quantum Mechanics a redefining of Newtonian Mechanics *in your
> eyes or in your mind* ?
Neither.  QM does not redefine Newton.
Now I have a question that I asked you before that you haven't answered.
Can you solve FLT without p-adics?
No fair using reals.
-- 
D.
mentock@mindspring.com
http://www.mindspring.com/~mentock/index.htm
Return to Top
Subject: Re: What is so special about 13-14-15 triangles?
From: Richard Mentock
Date: Fri, 20 Dec 1996 09:35:30 -0500
John Nahay wrote:
> 
> David (margot@cnwl.igs.net) wrote:
> : >across the words "famous 13-14-15 triangle" several times.  I had never
> 
> Does it have an area which is rational (modulo sqrt(2)) or integral?
The altitude on the 14 side is 12, so the area is 84.  The other 
altitudes (2*82/15, 2*84/13) are not as nice.
-- 
D.
mentock@mindspring.com
http://www.mindspring.com/~mentock/index.htm
Return to Top
Subject: Re: Spivak's "Calculus on Manifolds"
From: weemba@sagi.wistar.upenn.edu (Matthew P Wiener)
Date: 20 Dec 1996 13:56:10 GMT
In article <59dcog$p47@nnrp1.farm.idt.net>, select information exchange You may be a future fields medalist, but I can't reccomend the book.
He didn't ask for your recommendation regarding Spivak COM.
>It's a great book if you know the stuff or if someone will guide you and
>explain the proofs.
Of if you are motivated and work it through.  You'll learn a heck of a lot.
>		      However if you want some basic analysis check out
>Rudin's Principles of Mathematical Analysis.
And if he wants basic algebra there's Herstein TOPICS IN ALGEBRA.  You
perhaps have some point, but it escapes me.
>					       This book is a classic and
>readable.
Indeed.  But it has little to do with the request at hand.
>           A good supplement might be Buck's Advanced Calculus.
He did not request advanced calculus either.  A would-be reader of Spivak
COM should already be familiar with the material in Buck's book.  Indeed,  
Spivak is a supplement to Buck, not vice versa.
>								  Spivak's
>book seems very slick and unmotivated.
But if you just bear down and work your way through it, you will master it.
>				         You may need someone to fill in
>the gaps.
Or he may fill them in himself.  His instructor recommended it to him,
so I presume he is not both alone and has already been judged ready to
make his first go at it by someone more acquainted with him than you
or I.
>           If you already know Rudin, then you will follow Spivak.
Unless, of course, you have some great mental block regarding the modern
slick approach to calculus on manifolds.  That's how it goes sometimes.
>								     A next
>book might then be Folland's Real Analysis or Royden's Real Analysis.
>Both have diferent approaches but are great in their own way.
They do not cover the same topic, although there is some overlap.  You as
might as well say "a next book might be Spanier ALGEBRAIC TOPOLOGY".
>							        If you need
>any other advice, e-mail me.
You seem to be good with the "other", yes.
------------------------------------------------------------------------
Regarding the actually posted request, a warm up to Spivak COM, try
Harold Edwards ADVANCED CALCULUS: A Differential Forms Approach (3rd
edition), Birkhauser.
-- 
-Matthew P Wiener (weemba@sagi.wistar.upenn.edu)
Return to Top
Subject: What Mac programs handle large integers?
From: wdavidon@haverford.edu (Bill Davidon)
Date: Fri, 20 Dec 1996 10:12:41 -0500
What programs are available for the Mac which handle arithmetic of large
integers (at least 20 digits) and possibly other number theoretic
operations?
Bill Davidon       wdavidon@haverford.edu
http://www.haverford.edu/math/wdavidon.html
Return to Top
Subject: Re: Vietmath War: need help on physics history
From: Richard Mentock
Date: Fri, 20 Dec 1996 09:30:56 -0500
Archimedes Plutonium wrote:
> 
> In article <32B9BC0A.63A3@mindspring.com>
> Richard Mentock  writes:
> 
> > What about the old trisection of angle using compass and straightedge?
> > That was long considered impossible, and was proven impossible in the
> > nineteenth century.  However, if you change the rules just a little bit
> > (allow the solver to mark on the straightedge, or even to have had a
> > mark on the straightedge), then the problem is solvable.
> 
> The purpose of analogies is to devise them to help you think. Not to
> turn the switch off. For every 1 helpful analogy, a person can dream up
> an infinity of useless analogies. But I am talking to deaf and dumb
> ears here, can you read lips?
Yes but we're not that close.  Can you answer this:  Do you consider
the trisection of the angle possible or impossible?  Your answer will 
tell me whether you understand mathematics or not.
-- 
D.
mentock@mindspring.com
http://www.mindspring.com/~mentock/index.htm
Return to Top

Downloaded by WWW Programs
Byron Palmer