Find all the positive divisors.

[cragar]

Homework Statement

Find all the positive divisors of 10^n
where n is a positive integer.

The Attempt at a Solution

can I factor this like 2^n5^n
I notice that 10 has 4 divisors and 100 has 8
so it might seem that it has 4n divisors but I am not should how to give a nice proof of it.

 

[micromass]

Hi cragar!

Homework Statement

Find all the positive divisors of 10^n
where n is a positive integer.

The Attempt at a Solution

can I factor this like 2^n5^n
I notice that 10 has 4 divisors and 100 has 8
so it might seem that it has 4n divisors but I am not should how to give a nice proof of it.

100 has more than 8 divisors! In fact, these are the divisors of 100:

1,2,4,5,10,20,25,50,100

So 100 has 9 divisors! (you might see another pattern popping up now).

To prove the general conjecture, you need to find a connection between the divisors and the prime factorization. That is, if you know the prime factorization, how can you calculate all the divisors?

If you're unsure where to begin, begin by calculating the prime factorization of the 9 divisors of 100, and see if you notice something cool...

 

[spamiam]

Looks like a good start, cragar! Except 100 has 9 factors:
1, 2, 4, 5, 10, 20, 25, 50, 100.

Anyway, now it's essentially a combinatorics problem. Using your prime factorization of 10^n, any divisor will be of the form 2^k 5^k with k between what and what? From there it's just a counting problem.

EDIT: Whoops, beaten to the punch!

 

[cragar]

thanks for the help guys, I see that any divisor can be written as
2^k5^d
where k and d go from 0 to n , so i just have all the different possible combinations of k and d between 0 to n .

 

[micromass]

And can you find how many different such combinations there are?

 

[Dickfore]

You can have the following divisors, not sorted in an increasing order:

<br /> \begin{array}{l}<br /> 1, 5, 5^{2}, \ldots, 5^{n} \\<br /> 2, 2*5, 2*5^{2}, \ldots, 2*5^{n} \\<br /> \ldots \\<br /> 2^{n}, 2^{n}*5,2^{n}*5^{2}, \ldots, 2^{n}*5^{n}<br /> \end{array}<br />

 

[gb7nash]

Perhaps an easier way of looking at it is this:

Step 1: Pick number of 2's

n+1 ways (do you see why?)

Step 2: Pick number of 5's

n+1 ways (do you see why?)


Since these operations are independent...

 

[cragar]

Perhaps an easier way of looking at it is this:

Step 1: Pick number of 2's

n+1 ways (do you see why?)

Step 2: Pick number of 5's

n+1 ways (do you see why?)
Since these operations are independent...

It seems like you would have to construct all the divisors from the primes from 0 to n,
I am not sure exactly why you would pick them n+1 ways?
Is the reason i can pick the number of 2's (n+1) ways because I can pick it n ways and then I also want to include zero so I add one.
And then I will pick 5 the same way and then I will multiply my choices together
(n+1)(n+1)

 

[gb7nash]

Is the reason i can pick the number of 2's (n+1) ways because I can pick it n ways and then I also want to include zero so I add one.
And then I will pick 5 the same way and then I will multiply my choices together
(n+1)(n+1)

Correct

 

[cragar]

sweet thanks