Cody

# Problem 43755. Divide the Least Common Multiple by the Greatest Common Divisor of two numbers

Solution 2078787

Submitted on 4 Jan 2020 by Asif Newaz
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
x = 12345; y = 54321; y_correct = 74510305; assert(isequal(your_fcn_name(x,y),y_correct))

ans = 74510305

2   Pass
x = 12; y = 54; y_correct = 18; assert(isequal(your_fcn_name(x,y),y_correct))

ans = 18

3   Pass
x = 1; y = 1; y_correct = 1; assert(isequal(your_fcn_name(x,y),y_correct))

ans = 1

4   Pass
x = 987654321; y = x; y_correct = 1; assert(isequal(your_fcn_name(x,y),y_correct))

ans = 1

5   Pass
x = 800; y = 26000; y_correct = 130; assert(isequal(your_fcn_name(x,y),y_correct))

ans = 130

6   Pass
x = 65536; y = 32768; y_correct = 2; assert(isequal(your_fcn_name(x,y),y_correct))

ans = 2

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!