can you help me turn this algorithm to matlab and plotting the number of earring
1 vue (au cours des 30 derniers jours)
Afficher commentaires plus anciens
fonction pgd n:entier; var i debut i=2 tantque i≤n/2 et (n mod i)#0 faire i=i+1 fintantque si (n mod i)=0 alors pgd=n div i sinon pgd=n finsi fin
0 commentaires
Réponse acceptée
Roger Stafford
le 9 Nov 2013
Modifié(e) : Roger Stafford
le 9 Nov 2013
It looks as though you want to find the largest divisor of n less than n if n is not a prime number, and otherwise the prime number n itself. You could perhaps make your code more efficient if you replaced "i≤n/2" with "i<=sqrt(n)".
I am not sure about the name of your function. I don't understand that request about "plotting the number of earring".
function pgd = entier(n)
i = 2;
while i≤n/2 & mod(n,i)~-0
i = i+1;
end
if mod(n,i)==0
pgd = n/i;
else
pgd = n;
end
end
Plus de réponses (0)
Voir également
Catégories
En savoir plus sur String Data dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!