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.
how do we describe 11 positive divisors? say we have a number like 30, what are its positive divisors?
are they: 2,3,5 ? or, 1,30, 2,15, 3,10, 5,6 ??
the second set of numbers you gave would be it's positive divisors.
so number of divisors is tau function right ? are you familiar with it ?
so when you say n is an odd integer with 11 positive divisors means \(\Large \tau(n)=11\)
now tau function is multiplicative which means it have this property \(\Large \tau(a\times b)=\tau(a)\times\tau(b)\)
hello there @contradiction are u with me ?
so \(\Large \tau(8n^3)=\tau(8)\times(\tau(n))^3\)
sorry for the late response
dont divisors some in groups of 2?
hmm, 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
an 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)
n^3 = 3^(30) 2^3 = 8, so (3+1)(30+1) seems to be a specific approach
ah, right, that makes sense
okay, i got it! thank you!