RosettaCodeData/Task/Perfect-numbers/Oforth/perfect-numbers.fth

: isPerfect(n)  | i | 0 n 2 / loop: i [ n i mod ifZero: [ i + ] ] n == ;