if N=1:12 and m=1:12, How can I write if mod(N,m)==0, continue until mod(N,m) doesn't equal 0? I also want the answer for each N to be the number of times it continued until it didn't equal 0

댓글 수: 3

Ilham Hardy
Ilham Hardy 2016년 1월 13일
The result would always 0, wouldn't it?
A123456
A123456 2016년 1월 13일
for example, if N=8 and m=2, 8/2=4 with remainder 0 and then 4/2=2 with remainder 0 and finally 2/2=1 with remainder 0. If i continue, 1/2=0.5, 0.5 is not an integer and will therefore give me a remainder. So I want to write a code that will stop before I get a non-integer.
jgg
jgg 2016년 1월 13일
편집: jgg 2016년 1월 13일
How do you know where to start in this sequence? This seems to depend on what value of N and m you begin at and the order your progress?

댓글을 달려면 로그인하십시오.

답변 (0개)

카테고리

도움말 센터File Exchange에서 Performance and Memory에 대해 자세히 알아보기

태그

질문:

2016년 1월 13일

편집:

jgg
2016년 1월 13일

Community Treasure Hunt

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

Start Hunting!

Translated by