+0

0
113
7
+81

Suppose a and b are positive integers such that gcd[a,b] is divisible by exactly 7 distinct primes and lcm{a,b} is divisible by exactly 28 distinct primes. If a has fewer distinct prime factors than b, then a has at most how many distinct prime factors?

Thank you so much in advance!

Apr 16, 2021

#1
+180
+4

https://web2.0calc.com/questions/help-asap_33

Apr 16, 2021
#2
+81
+2

Thank you so much, but that answer is incorrect. The correct answer is 17.

TheMathWhiz  Apr 16, 2021
#3
+180
+1

Sorry about that but thank you for letting me know.

Mathdory  Apr 16, 2021
#5
+114070
+2

A note for next time:

If you know the answer is wrong you should say so on the original. (with your reason given)

And if you knew that the original quation was there, this one should have been done as a repost.

(With the address of the original)

Melody  Apr 16, 2021
edited by Melody  Apr 16, 2021
#6
+180
+2

Sorry but when I looked at it, it was locked so I couldn't answer it but thanks for the tip

Mathdory  Apr 16, 2021
#7
+114070
+1

Ok, sorry that explains it.

You can always send a private message to  a moderator asking them to unlock a question.

Also you can still put a link to the original and explain that it is, and, may continue to be locked.

You could also comment on my new answer on the old thread, as that thread is no longer locked.

Melody  Apr 16, 2021
edited by Melody  Apr 16, 2021
#4
+114070
+3