Let n = pk1 1 pk2 2 pkm m where p1, p2,...,pm are distinct

Chapter 9, Problem 9.62

(choose chapter or problem)

Let n = pk1 1 pk2 2 pkm m where p1, p2,...,pm are distinct prime numbers and k1,k2,...,km are positive integers. How many ways can n be written as a product of two positive integers that have no common factors a. assuming that order matters (i.e., 815 and 158 are regarded as different)? b. assuming that order does not matter (i.e., 815 and 158 are regarded as the same)?

Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.

Becoming a subscriber
Or look for another answer

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back