833
Christian Urban <christian.urban@kcl.ac.uk> 
parents:  
diff
changeset
 
 | 
     1  | 
// Find all factors of a given input number
  | 
| 
933
 | 
     2  | 
// by J.R. Cordy August 2005
  | 
833
Christian Urban <christian.urban@kcl.ac.uk> 
parents:  
diff
changeset
 
 | 
     3  | 
  | 
| 
933
 | 
     4  | 
write "Input n please";
  | 
833
Christian Urban <christian.urban@kcl.ac.uk> 
parents:  
diff
changeset
 
 | 
     5  | 
read n;
  | 
| 
933
 | 
     6  | 
write "The factors of n are:\n";
  | 
833
Christian Urban <christian.urban@kcl.ac.uk> 
parents:  
diff
changeset
 
 | 
     7  | 
f := 2;
  | 
Christian Urban <christian.urban@kcl.ac.uk> 
parents:  
diff
changeset
 
 | 
     8  | 
while (f < n / 2 + 1) do {
 | 
| 
860
 | 
     9  | 
  if ((n / f) * f == n)
  | 
| 
933
 | 
    10  | 
  then  { write(f); write "\n" }
 | 
| 
860
 | 
    11  | 
  else { skip };
 | 
833
Christian Urban <christian.urban@kcl.ac.uk> 
parents:  
diff
changeset
 
 | 
    12  | 
  f := f + 1
  | 
| 
933
 | 
    13  | 
}
  |