code to find the first whole number divisible by 1 to n

2 次查看（过去 30 天）
Athot Karmacharya
Athot Karmacharya 2020-9-22
评论： Athot Karmacharya 2020-9-29
Greetings!!! :)
Can someone edit the following code to ask a user the number (n)?; where the code could run and find the first whole number divisible by all the numbers from 1 to n. Below example displays the first whole number which is divisible by all the numbers from 1 to 13.
***********
function first_whole_number
i=1;
while i>=0
if mod(i,2)==0 && mod(i,3)==0 && mod(i,4)==0 && mod(i,5)==0 && mod(i,6)==0 && mod(i,7)==0 && mod(i,8)==0 && mod(i,9)==0 && mod(i,10)==0 && mod(i,11)==0 && mod(i,12)==0 && mod(i,13)==0
break;
else
i=i+1;
end
end
fprintf('\n\nthe first whole number divisible by 1 to 13 is %d\nThankyou\n\n\n',i);
end
**********
THANKYOU :)

请先登录，再回答此问题。

采纳的回答

Looky
Looky 2020-9-22
the mod function accepts a vector for the second argument, you can use this to check for a sequence of factors, e.g.:
if(any(mod(i,[2:n])))
i=i+1;
else
break;
end
However, this can become very slow and you might think about a more mathematical solution instead of checking every number.
  3 个评论
显示 1更早的评论

请先登录，再进行评论。

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Programming 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by