HDTenEightyP/NetNews huggingface dataset:
From: echinter@flash.tamsun.edu (Eric Chinter)
Newsgroups: sci.math,sci.physics,sci.chem,sci.bio
Subject: TIME HAS INERTIA--INDEPENDENT VALIDATION OF ABIAN
Date: 14 Dec 92 22:56:00 GMT
Organization: Independent Labs

I was extremely SCEPTICAL that any of ABIAN's claims were TRUE, but
after I E-MAILED him for a more thorough DESCRIPTION of his THEORY, I
was able to determine that it is CONSISTENT of itself and EXPLAINS
adaquately many WELL-KNOWN and ACKNOWLEDGED PHENOMINONS.  ALL of his
EQUATIONS follow neatly and cleverly from his several stated AXIOMS
and POSTULATES.  FURTHERMORE, his THEORY makes several PROFOUND
STATEMENTS that apparently have never before come to the attention of
OTHER SCIENTISTS!!!  They are in fact so PROFOUND and EARTH-SHATTERNIG
in their IMPLICATIONS that I will not reveal them except in private
e-mail, but SEVERAL LABS have been notified and are setting up
EXPERIMENTS to test WHETHER the UNFORSEEN IMPLICATIONS are indeed
TRUE!!!  Preliminary results from one of the labs support the brilliant
THEORY of DOCTOR ABIAN, but of course only time will VINDICATE him
COMPLETELY.

Anyone who desires to see the document of INDEPENDENT VERIFICATION whihc
I will have prepared within ONE (1) week should send me PRIVATE E-MAIL.

Thank you, and GOD-WILLING we'll set this mess straight!

Eric CHINTER, PhD Berekeley
Newsgroups: sci.math
From: jon@playfair.Stanford.EDU (Jon Buckheit)
Subject: Re: Diff Eq Books
Organization: Stanford University
Distribution: su
Date: Sun, 13 Dec 92 01:16:48 GMT

In article <85218@ut-emx.uucp>, tlea@ccwf.cc.utexas.edu (Thomas C. Lea) writes:
|> I just finshed my first Diff Eq course and realy liked it.  To bad I had
|> such a horrible book, along with a teacher.  So I'm looking for a good
|> first book on Diff Eq.  The Book we used was by Guterman & Nitecki.  Any
|> suggestions would be greatly appreaciated.

Depending on how deep you want to pursue the topic, two books I'd
recommend looking at for starters are the ones by Boyce and DiPrima
and Braun.  The latter is more advanced.
From: li@sce.carleton.ca (Yao Li)
Newsgroups: sci.math
Subject: answer to "math problem"
Date: 14 Dec 92 01:56:36 GMT
Organization: Indiana University
X-Mailer: ELM [version 2.3 PL11]


                       Answer to "Math Prblem"

Few days ago, I posted the following msg in Usenet bulletins: sci.math,
soc.culture.china.

>                            Math Problem
>                            ------------
>There is a polynomial:
>       -a*y**n + y**(n-1) + y**(n-2) + ... + y + 1 = 0
>where real number a>0 and the notation "y**n" represents the nth power of y.
>It's conjectured that this polynomial has a unique positive real solution y.
>Can you prove it or find a counter example?

Since then, I received many answers. Here I list one due to

>prince@ruccs.rutgers.edu (Alan Prince)  Fri, 11 Dec 92 16:17:15 EST
>
>Let P(y) be the polynomial in question.
>      First, notice that, since there is one sign-change in
>the coefficients, P(y) has AT MOST one positive zero, by the 
>Harriot-Descartes rule of signs.
>      Second, notice that P(0) = 1 and P(y) -> -infty as y ->
>+infty, so that P(y) must become negative for some y>0.  Therefore
>there is AT LEAST one positive zero. 
>      QED.

Other people's wits are also acknowledged. They are

Victor Adamchik <victor@wri.com>
W. Huang <uphhswh%msu.dnet@terra.oscs.montana.edu>
Shidong Tong <stong@irus.rri.uwo.ca>
Bob Silverman <bs@linus.mitre.org>
ZHIGANG XI <XI@BINAH.CC.BRANDEIS.EDU>
Michael Somos <somos@alpha.ces.cwru.edu>
xyl00@pteng.amdahl.com (Xiaoyang Luo)
cheekai@ncb.gov.sg (Chin Chee-Kai)
<erick@sfu.ca>

I put answers from all of them in a file. If anyone is interested, please
send me a msg.

Thanks for all

Li Yao
Newsgroups: sci.math,sci.physics,sci.bio,sci.chem,misc.education
From: crb7q@kelvin.seas.Virginia.EDU (Cameron Randale Bass)
Subject: Re: TIME HAS INERTIA - NewScientist Article
Organization: University of Virginia
Date: Mon, 14 Dec 1992 05:53:11 GMT

In article <1992Dec14.023025.20353@dmp.csiro.au> lachlan@dmp.csiro.au (Lachlan Cranswick) writes:
>
>Whenever I hear a new theory getting slammed by the mainstream
>scientific community, I always think of Wegener's theory
>that initially was so thoroughly trampled  which I also
>remember was pretty personal against him (even if I forget the name
>and get the decade wrong).

     The problem here is that there is no theory.  Abian's statements
     are basically equivalent to 'WHATEVER IT IS THAT HAPPENS, HAPPENS'.
     I have a better one (D1) that states 'THINGS CHANGE UNLESS THEY DON'T'.
     Neither is a scientific theory.  Wegener, at least, could have been
     wrong.

>No flames please -                        
>I'm blindly going with the majority view on Albian's attempted theory.

     Don't blindly do it.  Realize that a physical theory must 
     have some connection with the physical universe.  Since his doesn't,
     it isn't even a theory.
>
>>      This has been going on for probably 55 days.  I don't
>>      see any end to it.
>

>This is more proof that sci.chem is ceasing to be a happening
>place.  Where are our crackpots and resident loonies?           
>Should we take out an anti-monopoly suite
>against sci.physics for cornering the market?

     I'm sure everyone would here be happy to lend you this one.

     Have a nice evening.

                            dale bass
-- 
C. R. Bass                                          crb7q@virginia.edu        
Department of Mechanical, 
     Aerospace and Nuclear Engineering
University of Virginia                              (804) 924-7926
Newsgroups: sci.math,sci.philosophy.tech
From: knapp@spot.Colorado.EDU (David Knapp)
Subject: Can we have sci.chem back? (was Re: TIME HAS INERTIA abian stuff)
Organization: University of Colorado, Boulder
Date: Mon, 14 Dec 1992 19:14:34 GMT

In article <1gh38uINN93b@chnews.intel.com> bhoughto@sedona.intel.com (Blair P. Houghton) writes:
>In article <1992Dec13.195740.10476@galois.mit.edu> jbaez@riesz.mit.edu (John C. Baez) writes:
>>Do they mention that I invented the crackpot index?  Probably not.  Yet
>>another brilliant idea of mine leading to no tangible fame.  :-)
>>Maybe I should write a letter to the editor.
>


Can we please not consume so many net.resources to bashing ABIAN?
Will you all kindly look at how many groups you are crossposting to?
How about making an alt.abian group or taking this to email?



-- 
David Knapp                                      University of Colorado, Boulder
Perpetual Student                                   knapp@spot.colorado.edu
Newsgroups: sci.math
From: boll@CS.ColoState.EDU (dave boll)
Subject: Re: Master Mind:A question.
Date: Mon, 14 Dec 1992 21:24:42 GMT
Organization: Colorado State University, Computer Science Department
Keywords: Master Mind Game

In article <gay.724358375@sfu.ca> gay@selkirk.sfu.ca (Ian D. Gay) writes:
>jimgar@scorch.apana.org.au (Jim Garner) writes:
>
>>evant@coos.dartmouth.edu (Evan E. Thomas) writes:
>
>>|My question regards the game "MasterMind" where 4 pegs are chosen (from an
>>[deletions]

>>There is an optimal strategy that has been published. It is very long
>>and divided into cases, so I wouldn't call it an algorithm. But it
>>certainly can be done in less than 10 guesses every time. All I
>>remember is that your first guess should contain 2 colours only, 2
>>pegs of each.
>
   One such algorithm was published in the Journal of Recreational
   Mathematics; in '70 or '71 (I think), which always solved the
   4 peg problem in 5 moves. Knuth later published an algorithm which
   solves the problem in a shorter # of moves - on average - but can
   take six guesses on certain combinations.

-- 
     ------------------------------------------------------------
     Dave Boll  boll@handel.cs.colostate.edu
                "The speed of time is 1 second per second"
     ------------------------------------------------------------
Newsgroups: sci.math,sci.physics,sci.bio,sci.chem,misc.education
From: mkrogers@unix.amherst.edu (MICHAEL K ROGERS)
Subject: Re: Can we have sci.chem back? (was Re: TIME HAS INERTIA abian stuff)
Followup-To: sci.math,sci.physics,sci.bio,sci.chem,misc.education
Organization: Amherst College
X-Newsreader: TIN [version 1.1 PL7]
Date: Mon, 14 Dec 1992 22:08:09 GMT

David Knapp (knapp@spot.Colorado.EDU) wrote:
:
: Can we please not consume so many net.resources to bashing ABIAN?
: Will you all kindly look at how many groups you are crossposting to?
: How about making an alt.abian group or taking this to email?

Hear, hear!
Newsgroups: sci.math
From: dy@shire.math.columbia.edu (Deane Yang)
Subject: Course on stochastic models of derivative securities
Organization: Mathematics Department, Columbia University
Date: Fri, 18 Dec 1992 20:03:05 GMT
Distribution: ny
X-Posted-From: shire.math.columbia.edu
NNTP-Posting-Host: sol.ctr.columbia.edu

The mathematics department at Polytechnic University in Brooklyn
is considering offering a course on mathematical models of derivative
securities. The prerequisites for the course would consist only of
2 years of calculus and basic probability. No knowledge of economics
or finance is being assumed. The purpose of the course is to develop
 the mathematical methods necessary for understanding
 financial models, such as the Black-Scholes equation.

Since sci.math seems to be read by some people who work
in this area, I wanted some advice.

1) Are there people on Wall Street who would want to take this course?
Obviously, people who are already doing this sort of stuff don't need
this course. However, would it be useful to have someone who is not
a "quant" take a course like this? If so, who?

2) If such people exist, what would be the best way to advertise the
course?

3) Other suggestions or questions are welcome.

Deane Yang
Department of Mathematics
Polytechnic University

P.S. I am not the instructor of this course and know nothing
Newsgroups: sci.math,rec.puzzles
From: snewman@Xenon.Stanford.EDU (Steven Newman)
Subject: Re: Marilyn Vos Savant's error?
Organization: Computer Science Department, Stanford University.
Date: Tue, 15 Dec 1992 19:59:23 GMT

> [discussion of the other-child-sex problem]
> 
> > ... (One must be careful in the interpretation of the statement in
> > problem 1; it means "I have two children, and it is not the case
> > that both of them are girls.")
> 
> You have to be more careful than that; for problem 1 I get 1/3 under
> only one of my four proposed sets of assumptions, and one which in my
> opinion is relatively unreasonable.  Problem 2 runs into similar
> difficulties; the only set of assumptions I can think of offhand to
> get the answer 1/2, is that nobody cares about younger children so
> they always tell you about their oldest.  Under more reasonable
> assumptions (i.e. if both are boys, the person will say so), I still
> get the answer 0.
> 
> -- David Karr (karr@cs.cornell.edu)

You're right, I should have been more precise in the problem statement,
e.g. "you ask the man if it is the case that he has exactly two children
and furthermore at least one of them is a boy.  He says 'yes'.  What is
the probability that both of his children are boys?".  However, this sort
of phrasing doesn't look as nice in the puzzle books (which is part of
what gets us into trouble in the first place).

 - Steve Newman (snewman@cs.stanford.edu)
From: bubai@matt.ksu.ksu.edu (P. Chatterjee)
Newsgroups: sci.math
Subject: Need some help with Topology
Date: 12 Dec 1992 02:15:46 -0600
Organization: Kansas State University
NNTP-Posting-Host: matt.ksu.ksu.edu

I had a few questions (none homework, though!) and would appreciate any   
kind of help from the math-knowledgeables on the net.


a) What does it mean to say that a set A is 'infinite'? 'Finiteness', by 
definition, implies that A is equivalent to a portion of the set of 
positive integers. Can this definition of 'finiteness' be used to 
motivate one for 'infiniteness'?

b) Show that A is OPEN <==> X \ A is closed. 
Isn't this a definition or can it be proven?

c) If A is infinite and p in A, show that A \ {p} is equivalent to A.


d) Show that (A')' is a subset of A'.

I'm studying for an exam and these conceptual glitches need to be clarified
before I plunge into it.


Thanks for all the help.
From: fau@po.CWRU.Edu (Francis A. Uy)
Newsgroups: sci.math
Subject: need proof:  (1 + 1/n)^n ==> e
Date: 15 Dec 1992 23:51:54 GMT
Organization: Case Western Reserve University, Cleveland, OH (USA)
Reply-To: fau@po.CWRU.Edu (Francis A. Uy)
NNTP-Posting-Host: hela.ins.cwru.edu


I can't believe I forgot the proof of this one.
 Subject line says it all.
From: wstomv@wsinfo01.win.tue.nl (Tom Verhoeff)
Newsgroups: sci.math
Subject: Densest Sphere Packings in 3D?
Keywords: Face-Centered Cubic Lattice
Date: 19 Dec 92 10:01:41 GMT
Reply-To: wstomv@win.tue.nl

Could someone point me to recent results on the densest-sphere-packing
problem for 3D space?  I heard that it was finally proved that
the face-centered cubic lattice (also known as rhombohedral lattice?)
is indeed a densest packing.  Is this correct and, if so, what is
a good reference?

	Tom
-- 
INTERNET: wstomv@win.tue.nl  /    Eindhoven University of Technology
VOICE: +31 40 47 41 25      /    Dept of Mathematics & Computing Science
FAX: +31 40 43 66 85       /    PO Box 513, NL-5600 MB Eindhoven, Netherlands
Newsgroups: sci.math,sci.edu
From: edgar@function.mps.ohio-state.edu (Gerald Edgar)
Newsgroups: sci.math
Subject: Re: Pi Finder
Date: 15 Dec 1992 09:37:58 -0500
Organization: The Ohio State University, Dept. of Math.
NNTP-Posting-Host: function.mps.ohio-state.edu

In article <1992Dec14.165705.872@imag.fr> samama@imag.imag.fr (Marc Samama) writes:
>Do you know what algorithms Mma uses to calculate Pi ?

Mathematica's algorithms are mostly secret...
Here is what you find in Maple:

> interface(verboseproc=2);

> evalf(Pi,100);
3.14159265358979323846264338327950288419716939937510582097494459\
2307816406286208998628034825342117068


> print(`evalf/constant/Pi`);
proc()
local a,r,t;
options `Copyright 1990 by the University of Waterloo`;
    if Digits <= 51 then


and so on.  The procedure to compute Pi is printed out for you.
It seems that for <= 51 digits, it has Pi stored here.  For <= 10000
digits, it uses bigPi, stored in the library, and in general uses
a hypergeometric function.  No, it's not an arctangent.


-- 
  Gerald A. Edgar                Internet:  edgar@mps.ohio-state.edu
  Department of Mathematics      Bitnet:    EDGAR@OHSTPY
  The Ohio State University      telephone: 614-292-0395 (Office)
  Columbus, OH 43210             -292-4975 (Math. Dept.) -292-1479 (Dept. Fax)
Newsgroups: sci.math,sci.physics,sci.bio,sci.chem,misc.education
From: crb7q@kelvin.seas.Virginia.EDU (Cameron Randale Bass)
Subject: Re: TIME HAS INERTIA - BASS JEALOUS AND INSECURE-ABIAN VALIDATED
Organization: University of Virginia
Date: Sun, 13 Dec 1992 08:33:56 GMT

In article <abian.724200923@pv343f.vincent.iastate.edu> abian@iastate.edu (Alexander Abian) writes:
>FLAGRANT MANIFESTATION OF JEALOUSY AND INSECURITY BY C.R. BASS 
>PATHETIC METHODS FOR GAINING A FEELING OF SECURITY. BASS  PROVES (A3) 

     No I proved C1.  I have this strong hankering for cheese.

     Later darling,

                           dale bass
-- 
C. R. Bass                                          crb7q@virginia.edu        
Department of Mechanical, 
     Aerospace and Nuclear Engineering
University of Virginia                              (804) 924-7926
Newsgroups: sci.math
Subject: Re: TIME HAS INERTIA - NewScientist Article
From: a_rubin@dsg4.dse.beckman.com (Arthur Rubin)
Date: 15 Dec 92 18:48:54 GMT
 <1992Dec12.195654.7419@murdoch.acc.Virginia.EDU>   
 <1992Dec14.023025.20353@dmp.csiro.au> <1992Dec14.055311.10343@murdoch.acc.Virginia.EDU> <1992Dec15.060749.3517@coplex.com>
Organization: Beckman Instruments, Inc.

In <1992Dec15.060749.3517@coplex.com> chuck@coplex.com (Chuck Sites) writes:

>crb7q@kelvin.seas.Virginia.EDU (Cameron Randale Bass) writes:

>There may be a test of this theory, alabet a tricky one.  A friend of mine
>asked the following question: If a neutrino has no mass, then it should
>not be effected by gravity.

I don't think so in the standard theories; if Wegener's theory states that,
then it is testable.



--
Arthur L. Rubin: a_rubin@dsg4.dse.beckman.com (work) Beckman Instruments/Brea
216-5888@mcimail.com 70707.453@compuserve.com arthur@pnet01.cts.com (personal)
My opinions are my own, and do not represent those of my employer.
My interaction with our news system is unstable; please mail anything important.
Newsgroups: sci.math
From: lady@uhunix.uhcc.Hawaii.Edu (Lee Lady)
Subject: Re: Function Terminology
Followup-To: sci.math
Summary: They are not the same as *morphisms*.  
Keywords:   function   morphism   codomain  
Organization: University of Hawaii (Mathematics Dept)
Date: Sat, 12 Dec 1992 19:27:24 GMT

In article <Bz48w1.G5C@mentor.cc.purdue.edu> hrubin@pop.stat.purdue.edu 
     (Herman Rubin) writes:
>>In article <1gaq3tINNg9q@uwm.edu> radcliff@csd4.csd.uwm.edu 
     (David G Radcliffe) writes:
>>>Suppose I have a function f: A --> B, and C is a subset of B which
>>>contains the image set of f.  I define a function g: A --> C by
>>>setting g(a) = f(a) for all a in A.  Usually, f and g can be considered 
>>>as the same function, but sometimes the distinction is important.
>>       ...
>The function is exactly the same.  A function, in whatever foundational
>system is used, is something which takes arguments in a domain and
>operates on them.  The image set depends only on f and A.  Which
>superset of the range is used does not affect the function.

Technically your answer is correct but the issue is real and I wish there
were a good answer for it, not only as regards notation but as regards
terminology.  In teaching courses such as abstract algebra I usually call
g  above the "restriction" of f,  with an audible emphasis to indicate
quotation marks around the word restriction or a verbal footnote to
indicate that I am using it in a non-standard sense.  

The point is that although most terminlogy would call  f  and  g  the
same *function*, from a categorical point of view they are not the same
*morphism*.  Given  h:B --> D,  I can form the composition  hf  but I
cannot form the composition  hg  because morphisms can only be composed
when the "codomain" of the one agrees with the domain of the other.  

This is not mere nitpicking, since if  F  is a functor then  F(g)  may be
very different from  F(f).  One may be a monomorphism (one-to-one), for
instance, and the other not.  In a course in algebra (or algebraic
topology) it is very important that students understand the importance of
this apparently trivial distinction.  

I think that your comment, Herman, reinforces the point I made earlier in
another thread that many mathematicians in fields such as analysis find
category theory totally irrelevant to what they do and never think in
categorical terms.  

--
It is a poor sort of skepticism which merely delights in challenging
those claims which conflict with one's own belief system.  
                                                          --Bogus quote 
lady@uhunix.uhcc.hawaii.edu         lady@uhunix.bitnet
Newsgroups: sci.math
From: gay@venice.sedd.trw.com (Lance Gay)
Subject: Re: Interesting Discrete Math Question
Organization: TRW Systems Engineering & Development Division, Carson, CA
Date: Wed, 16 Dec 1992 00:07:14 GMT

>In article <3548@carroll1.cc.edu> noffke@carroll1.cc.edu (Pat Noffke) writes:
>Here's a question we had on one of our last tests in Discrete.
>
>A jar contains 100 chips numbered 1 through 100.  I want to draw a
>subset of chips that satisfies the condition that at least two chips
>have values that differ by exactly 3.  What is the minimum number of
>chips I must draw to guarantee that I satisfy the condition?  Justify
>your response.
> 

Partition the integers into 3 sets:

  Set 1) 1, 4, 7, 10, ..., 97, 100  (34 integers)
  Set 2) 2, 5, 8, 11, ..., 95, 98   (33 integers)
  Set 3) 3, 6, 9, 12, ..., 96, 99   (33 integers)

Let us detemine the maximum number of chips which can be selected such
that no two chips differ by exactly three.
You may not choose any two adjacent members of any of the three sets.
The optimal stragtegy is to select every other member from each of the
three sets.  Thus we may choose 17 from the first set, 17 from the second
set and 17 from the third set for a total of 51.  (The numbers from the
first set can be chosen two different ways).

Thus the minimum number of chips to select to satify the condition is 52.


Lance J. Gay                                 Internet: gay@venice.sedd.trw.com
TRW Systems Engineering & Development Div.   Phone: 310-764-3988
Carson, CA  90746
From: NAHAJ@CC.UTAH.EDU (John B 'Nahaj' Halleck, UUCC)
Subject: Q on new(?) simple factoring algorithm.
Organization: UNIVERSITY OF UTAH COMPUTER CENTER
Date: Sun, 20 Dec 92 05:34:21 GMT
X-News-Reader: VMS NEWS 1.24

While investigating Fermat-like factoring algorithms, I derived the following
algorithm.  (Sorry folks, it's run time is the same as fermat's, no major
breakthrough.)  It, like Fermat's method, has only additions and tests in
the loop, but produces it's factors directly instead of generating quantities
that are used to [trivially] produce the factors.

I am unable to find this one in the literature, nor am I able to think of
any reason it ought not to be prefered to fermat's method.

SO.... Could some kind soul please refer me to where and by what name this
algorithm is already known? (And where to read up on it?)
Given the normal implimentation of Fermat's method (For example Knuth's Vol 2
code) also has an integer square root in the set up, could someone give
me a reason that this method should not always be prefered to Fermat's?

Please e-mail answers, as I don't really read this group.
I'll post a summary.

- John Halleck
nahaj@cc.utah.edu


---- Simple form of the algorithm (as C code) without any of the obvious ---
---- speedup's applied -----------------------------------------------------

#include <math.h>
long isqrt(long x) { return (long) sqrt((double) x); }
  /* This is a hack, a real integer square root would be much better */


#include <stdio.h>
main () {
 long p, q, n, guess;
 
 printf ("Input a positive non-zero number to be factored\n");
 scanf ("%ld",&n); printf ("We will try to factor %ld\n",n);
 
 q=p=isqrt(n); guess = p*q;
 
 while (guess != n) {
   if (guess>n) { guess -= p; q--; }
   else         { guess += q; p++; }
 }

 printf ("two possibly non-prime factors are %ld, %ld.\n",q,p);
 return 0;
}







------------- For the curious, why does this work? ------

A number to be factored can be represented in the form  SS+R
where S is the integer square root.   The two factors are of the form:
  (S+A)*(S-B) = p*q = n
multiplying out the expression gives:
  SS + SA - SB -AB = n
Adding one to A increases the expression on the left hand side by (S-B) which
is positive because S>A when we are talking about the factors.
Adding one to B decreasses the value of the LHS by (S+A).
So incrementing A increases our value, incrementing B decreases our value,
So we just go up and down till we hit the number...
The termination argument is about the same as it is for Fermat's method.

And yes, I know that there are lots of obvious speedups...