3 replies to this topic

[imapwnulol]

this is about pascal so i'm writing it here cause delphi is the closest thing...

i have this problem of making a program that will show the number of factors that can divide the integer you input.
for example if input is 10, output is 4 (1, 2, 5, 10).

[WingedPanther]

Do you know how to tell if a number is a factor of 10?
Do you know how to loop from 1 to the number entered?

[imapwnulol]

actually i don't. i guess i'd have to make the computer try dividing the number with all the smaller numbers, but how to leave ones that can't divide it, and how to count them?

[WingedPanther]

Look up modular division.