To determine all integers between 1 and 50 for which n3 ? n2 + 40 is greater than 1000 and n is not divisible by 3. And then solve the question:
Are any integers between 1 and 50 perfect (that is, are they equal to the sum of their factors)? The book gives the following code
n = 1:50;
f = n.^3-n.^2+40;
ii = find(f > 1000 & mod(n,3) ~= 0);
n(ii)
But I want to change this code only using a "for" and "if" loops. Can someone help me to change this code please?
Thanks a lot in advance.
See Question&Answers more detail:
os 与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…