A number theory problem by Merzel Mark Guilaran

Number Theory Level pending

What is the lowest common multiple of a number of distinct prime numbers.

The product of these prime numbers The sum of prime numbers multiply by their GCF The quotient of the product of the given prime numbers by its GCF. The highest given number

Merzel Mark Guilaran by Merzel Mark Guilaran , 27, Philippines

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Sabhrant Sachan
Oct 19, 2016

Please add " if we have distinct prime no.'s " . Basically GCD(P1,P2,P3...,Pn)=1

1 Helpful 0 Interesting 0 Brilliant 0 Confused

okie...... thanks.... lets add that if the GCD of the given numbers is 1....

Merzel Mark Guilaran - 4 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...