A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 one year ago
Let n be an odd integer with 11 positive divisors. find the number of positive divisors of 8n^3.
anonymous
 one year ago
Let n be an odd integer with 11 positive divisors. find the number of positive divisors of 8n^3.

This Question is Closed

amistre64
 one year ago
Best ResponseYou've already chosen the best response.1how do we describe 11 positive divisors? say we have a number like 30, what are its positive divisors?

amistre64
 one year ago
Best ResponseYou've already chosen the best response.1are they: 2,3,5 ? or, 1,30, 2,15, 3,10, 5,6 ??

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0the second set of numbers you gave would be it's positive divisors.

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0so number of divisors is tau function right ? are you familiar with it ?

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0so when you say n is an odd integer with 11 positive divisors means \(\Large \tau(n)=11\)

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0now tau function is multiplicative which means it have this property \(\Large \tau(a\times b)=\tau(a)\times\tau(b)\)

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0hello there @contradiction are u with me ?

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0so \(\Large \tau(8n^3)=\tau(8)\times(\tau(n))^3\)

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0sorry for the late response

amistre64
 one year ago
Best ResponseYou've already chosen the best response.1dont divisors some in groups of 2?

amistre64
 one year ago
Best ResponseYou've already chosen the best response.1hmm, i spose if one set was a perfect square then the grouping a,a would represent a single divisor as opposed to 2 of them

amistre64
 one year ago
Best ResponseYou've already chosen the best response.1an algorithm online says that the product of the exponents of the prime factorization ... when you add 1 gives us the number of divisors. so like: n=3^(10) has 11 divisors: (10+1)(0+1)

amistre64
 one year ago
Best ResponseYou've already chosen the best response.1n^3 = 3^(30) 2^3 = 8, so (3+1)(30+1) seems to be a specific approach

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0ah, right, that makes sense

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0okay, i got it! thank you!
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.