Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re^2: Finding all divisors of an integer

by pbeckingham (Parson)
on Jul 04, 2004 at 16:25 UTC ( [id://371715]=note: print w/replies, xml ) Need Help??


in reply to Re: Finding all divisors of an integer
in thread Finding all divisors of an integer

That's not at all the question that is being asked, and has nothing to do with primes. OP is asking for factorization all factors of a number.

Replies are listed 'Best First'.
Re^3: Finding all divisors of an integer
by gri6507 (Deacon) on Jul 05, 2004 at 16:40 UTC
    This algorithm finds all factors of a number!
Re^3: Finding all divisors of an integer
by Anonymous Monk on Jul 21, 2010 at 23:06 UTC
    If you multiply all the possible combinations of the prime factors together (and get rid of repeats), you get a list of all the factors, and the number itself. I wonder how you multiply all the possible combinations of a list...

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://371715]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others contemplating the Monastery: (3)
As of 2024-03-29 06:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found