List all the positive integer divisors of 3^s5^t, where s,t are integers and s,t >0. If r,s,t are positive integers, how many positive divisors does 2^r3^s5^t have? Please explain the answer, I am not sure how to get the result.

At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get our expert's

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this and thousands of other questions.

A community for students.

List all the positive integer divisors of 3^s5^t, where s,t are integers and s,t >0. If r,s,t are positive integers, how many positive divisors does 2^r3^s5^t have? Please explain the answer, I am not sure how to get the result.

Mathematics
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this and thousands of other questions

Oh boy.. what's a nice compact way to list all of these divisors.. hmm :d
take for example the number: \(\large\rm 16875=3^3\cdot5^4\) This number is divisible by: \(\large\rm 3^1,3^2,3^3\) \(\large\rm 5^1,5^2,5^3,5^4\) \(\large\rm 3^1\cdot5^1,~3^1\cdot5^2,~3^1\cdot5^3,~3^1\cdot5^4\) \(\large\rm 3^2\cdot5^1,~3^2\cdot5^2,~3^2\cdot5^3,~3^2\cdot5^4\) \(\large\rm 3^3\cdot5^1,~3^3\cdot5^2,~3^3\cdot5^3\) You can see it gets kind of crazy ^ We need a nice way to write this.. hmm
Is this confusing? Maybe I can do a smaller number as an example:

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

\(\large\rm 45=5\cdot9=5\cdot3\cdot3\) So this number is divisible by 3, 5, 3*3, 3*5, and 3*3*5. So the divisors are 3,5,9,15, and 45.
Hmm sorry, I'm not sure :c
@ganeshie8 @Kainui @dan815 any ideas? 0_o
|dw:1444634846449:dw|
The amount of ways to combine all the divisors together is quite nice, for instance, s and t could be 3 and 4 then you have: |dw:1444634910261:dw|
o thats nice
Actually I should have included \(3^0\) and \(5^0\) so it should be (3+1)*(5+1). This actually all stems from the fact that the divisor counting function is multiplicative, but there's no reason to get into that right now I think.
oh i remember doing this on a peuler question actually
So if you have \[n = \prod_k p_k^{\alpha_k}\] \[\tau(n) = \prod_k (1+\alpha_k)\]
|dw:1444635166020:dw|
Well the problem stated that s,t>0. So you don't really need to worry about that.
then just s*t
The first part of the question actually wanted you to `list them out`. I wasn't sure of an economical way to do that XD Maybe like the chart thing that Kai was doing?
oh u can write a nice forloop for kais chart
for i = 1:s for j=1:t print "3"+"^" + \i * + "*5"+"^" + \j * end end
Is there a math symbol for `for loop`? >.< Like.. Hey .. thing... I want to do this set of operations.. from this lower bound to this upper bound... I don't want you to add the results or multiply them... just list them -_- pls
|dw:1444635697073:dw|
im not really familiar with set notation
but something like this all the products for all the possible i , js, you will have a product for every different combinations of i and j
interesting :o
@zepdrix No we actually do have to worry about it, see you made the same mistake as me.
"positive integer divisors of 3^s5^t, where s,t are integers and s,t >0" 1, 3, and 5 are positive integer divisors of 15.
oh true it is (s+1)(t+1) -1 but subtract 1 because we only dont allow both to have 0 exponent
No wrong dan
i thought they dont like 1, since both s,t have to be more than 0
The divisors don't obey the same rule that s and t obey
ohh
i gotcha now
ya that was silly lol xD why were we cofusing the question for the actual divisors
Yeah actually it's kinda cool that the divisor function is a specific case of this: \[\sigma_k(n) = \sum_{d|n} d^k\] with the divisor counting function when k=0. You can see that you will get a geometric series so you have to use L'Hopital's rule to derive it from the general case if you're curious.

Not the answer you are looking for?

Search for more explanations.

Ask your own question