清空筛选条件
清空筛选条件

The greatest common divisor

3 次查看（过去 30 天）
Kentman
Kentman 2014-10-15
评论： Kentman 2014-10-15
Hello,
I just created function for greatest common divisor of two numbers. I want now to do the same for a whole matrix, that means for more than two numbers. But I don't know the idea, i was just confused how to write the program.
The original function was NSD, so i tried to build another one named NSD1 and call the original NSD inside it:
  • _function [value]=NSD1(A)
while i<=size(A,2)
val=NSD(A(i),A(i-1));
end
end_ *
and this is of course wrong, i thought of some tricks which are quite stupid. Can you help me?

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

采纳的回答

Sean de Wolski
Sean de Wolski 2014-10-15
Use a for loop over the elements in the matrix
for ii = 1:numel(A)
b(ii) = existing_gcd_algorithm(A(ii),c)
end
  1 个评论
Kentman
Kentman 2014-10-15
what do you mean by c?.. can you tell more of the pricniple of this method?

请先登录，再进行评论。

更多回答（0 个）

类别

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

标签

Community Treasure Hunt

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

Start Hunting!

Translated by