Re: smallest positive integer that has exactly k divisors

"mensanator@xxxxxxxxxxx" <mensanator@xxxxxxx> writes:
## Did you really mean 2000 factors? You do know that the
## number of divisors is 2**factors, don't you?

Really? Then how can 12 have 6 divisors?

It doesn't, it has 6 UNIQUE divisors.

(6 is not a power of 2.)

No, but 8 is:

000 12 2 * 2 * 3
001 4 2 * 2 * 1
010 6 2 * 1 * 3
011 2 2 * 1 * 1
100 6 1 * 2 * 3
101 2 1 * 2 * 1
110 3 1 * 1 * 3
111 1 1 * 1 * 1

Note, 6 appears twice as does 2, that's why there's 6.

You're not using the standard terminology which mathematicians
use. That's a trait which cranks have, for reference. I suspect
that you can't even consistently and unambiguously define what
you mean by "divisors". That is also a trait which cranks have.

Step in line, mensanator, lest you step too far out of line!

Phil
--
Dear aunt, let's set so double the killer delete select all.
-- Microsoft voice recognition live demonstration
.

Relevant Pages

  • Re: smallest positive integer that has exactly k divisors
    ... Then how can 12 have 6 divisors? ... it has 6 UNIQUE divisors. ... is the product of the smallest x prime numbers, in increasing order, ... adding an extra prime at the end. ...
    (sci.math)
  • Re: who has the most divisors ??
    ... On this journey we obviously would have come across the divisors, so by restricting it at it's ClosestKnownSqrt, we only allow part of the function through we simplify it exponentionaly. ... How far from being a rectangle or square they are. ... THREE and FOUR Unique Divisors (TWO DE2 Divisors) ...
    (sci.math)
  • Re: smallest positive integer that has exactly k divisors
    ... it has 6 UNIQUE divisors. ... square-free just means the UNIQUE divisors will be the same ... the duplicates when calculating probability? ... factorizations of 2000, ...
    (sci.math)
  • Re: smallest positive integer that has exactly k divisors
    ... Then how can 12 have 6 divisors? ... Assume the OP is interested in the number of unique divisors of n. ... The desired n is the product of the smallest x prime numbers, in increasing order, raised to exponents which are one less than the prime factors of k, in decreasing order. ...
    (sci.math)
Loading