Question

a) How many positive integers are divisors of 243,000,000? b) How many positive integers divide both...

a) How many positive integers are divisors of 243,000,000? b) How many positive integers divide both 243,000,000 and 1,440,000

Homework Answers

Answer #1

Note That: . where pi's are distinct primes

Then number of positive divisor of n =

a)

Total number of positive divisor = (6+1)(5+1)(6+1)

=7×6×7 =  

b) number of positive divisor of both given number = number of positive divisor of their g.c.d

Now, g.c.d.(243000000,1440000)=

Now,   

Number of positive divisor, = (6+1)(2+1)(4+1)=7×3×5=

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
a) How many positive divisors does 144 have? b) What is the sum of the positive...
a) How many positive divisors does 144 have? b) What is the sum of the positive divisors of 144? c) Which positive integers have an odd number of positive divisors? (Prove your answer)
For all integers a,b , c prove that if a doesn't divide then a doesn't divide...
For all integers a,b , c prove that if a doesn't divide then a doesn't divide b and a doesn't divide c
How many positive integers less than 10000 are there which contain at least one 3 or...
How many positive integers less than 10000 are there which contain at least one 3 or at least one 8 (or both)?
how many positive integers less than 1000 have no repeated digits?
how many positive integers less than 1000 have no repeated digits?
how many different positive integers less than 5,000 are not divisible by 10,14, or 15
how many different positive integers less than 5,000 are not divisible by 10,14, or 15
(a) If a and b are positive integers, then show that gcd(a, b) ≤ a and...
(a) If a and b are positive integers, then show that gcd(a, b) ≤ a and gcd(a, b) ≤ b. (b) If a and b are positive integers, then show that a and b are multiples of gcd(a, b).
(a) If a and b are positive integers, then show that lcm(a, b) ≤ ab. (b)...
(a) If a and b are positive integers, then show that lcm(a, b) ≤ ab. (b) If a and b are positive integers, then show that lcm(a, b) is a multiple of gcd(a, b).
Let a, b be integers with not both 0. Prove that hcf(a, b) is the smallest...
Let a, b be integers with not both 0. Prove that hcf(a, b) is the smallest positive integer m of the form ra + sb where r and s are integers. Hint: Prove hcf(a, b) | m and then use the minimality condition to prove that m | hcf(a, b).
How many positive integers less than 50 are not divisible by 2, 3 or 5? [8]...
How many positive integers less than 50 are not divisible by 2, 3 or 5? [8] Check your solution by listing the numbers and eliminating those which are divisible by 2, 3 or 5 and counting the remainder.
Prove: Let a and b be integers. Prove that integers a and b are both even...
Prove: Let a and b be integers. Prove that integers a and b are both even or odd if and only if 2/(a-b)
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT