creating a recursive prime numbers function

2 次查看（过去 30 天）

显示更早的评论

asaf omer 2019-8-5

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/474950-creating-a-recursive-prime-numbers-function

评论： Steven Lord 2019-8-5

hi ,

i wanna write a recursive function that provides me the primer divisors of a given number

for example 63

[3,3,7]

in adition , can u please explain me the recursive there?

thanks a lot!

3 个评论
显示 1更早的评论隐藏 1更早的评论

asaf omer 2019-8-5

so far i wrote this ;

function [res]=blah(n)

if n==1 || isprime (n)

res=n;

eles

res=mod(n,blah(n-1))

end

i know that i have some problems with the second part

Steven Lord 2019-8-5

What difficulty are you experiencing with this project?

Do you have an algorithm that you're not sure how to implement? One technique I use in this scenario is to write the steps of the algorithm as comments in the Editor then work my way through, implementing each step in turn. If I'm not sure how to implement a step, I break it up into substeps until I get to pieces I know how to write.

If you don't have an algorithm, since this sounds like a homework assignment does your textbook include such an algorithm?

请先登录，再进行评论。

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