# Write a function called smallest_multiple

11 ビュー (過去 30 日間)
RUTARAKA GIDEON 2018 年 3 月 4 日

2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. Write a function called smallest_multiple that returns a uint64, the smallest positive number that is evenly divisible by all of the numbers from 1 to n where n is a positive integer scalar and is the only input argument of the function. If the result would be greater than what can be represented as a uint64, the function returns 0.

サインインしてコメントする。

### 回答 (2 件)

Image Analyst 2018 年 3 月 4 日
Here is a hint:
function results = smallest_multiple(n)
##### 0 件のコメント表示非表示 -1 件の古いコメント

サインインしてコメントする。

Srishti Saha 2018 年 5 月 13 日
Here is a solution that worked for me:
%%alternative solution to smallest multiple
function r = smallest_multiple(k)
r = uint64(1);
for n = 1:k
r = r * (n / gcd(r,n));
end
if r == intmax('uint64')
r = uint64(0);
end
end
##### 4 件のコメント表示非表示 3 件の古いコメント
Ranil Fernando 2018 年 6 月 3 日
My code is working outside the grader for n=13 without taking a longer time. But within the grader it fails for even 2. Someone please give me a hand here.
function multiN = smallest_multiple(n)
mod2N = 0;
multiN = uint64(n);
while all(mod2N) == 0
multiN = multiN + 1;
mod2N = zeros(1,n);
for ii=1:n
if mod(multiN,ii) == 0
mod2N(ii) = 1;
elseif multiN == intmax('uint64')
multiN = uint64(0);
end
end
end

サインインしてコメントする。

### Community Treasure Hunt

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

Start Hunting!