NetNews Usenet Archive 1992 #20/NN_1992_20.iso/spool/sci/math/11100

Internet Message Format | 1992-09-08 | 1.1 KB

Path: sparky!uunet!noc.near.net!news.Brown.EDU!qt.cs.utexas.edu!yale.edu!jvnc.net!netnews.upenn.edu!cronkite.ocis.temple.edu!picasso.ocis.temple.edu!sklar
From: [e-mail] (Dave Sklar)
Newsgroups: sci.math
Subject: Prime Factor Numbers
Message-ID: <[e-mail]>
Date: 8 Sep 92 04:03:07 GMT
Sender: [e-mail] (NetWork News (readnews))
Organization: Temple University
Lines: 16
X-Newsreader: Tin 1.1 PL5


    Here's something I was thinking about.  Take a number, n, and write
down its prime factors [Excluding n and 1] from left to right, forming a new number.  Repeat.
    When you get to a prime number, you end. Let's call the function
d(n).  So, d(1001)=71113, d(5)=d(2)=d(11)=[Define something here, say]0.
    Does every number eventually go to a prime, and then 0?
    What happens if you include the 1 and n?  What happens if you write
prime factors that occur more than once once for each time they occur
instead of once for any number of times they appear? [d(20)=225 instead of
d(20)=25]

    If anybody has any references, as well, I'd love to see them.

Post or email.

Dave