-- mayton : 28-Sep. Yet another tiny factorization

primes :: [Int]
primes = filterPrime [2..]
  where filterPrime (p:xs) =
          p : filterPrime [x | x <- xs, (mod x p) /= 0]

factorize' :: Int -> [Int] -> [Int] -> [Int]
factorize' x divisors primesVals 
  |x == 1 = reverse divisors 
  |otherwise = let d = head primesVals 
               in if (mod x d) == 0 then factorize' (div x d) (d:divisors) primesVals
               else factorize' x divisors $ tail primesVals

factorize :: Int -> [Int]
factorize x = factorize' x [] primes

(x r+ a) (y r + b) - с = 0

class Number[T] with Factorizable[T] {

   def lazyFactorize() : Map[T,T] // если надо то любое число будет иметь вторую форму представления в виде 240 = 2^2 * 3 * 4 * 5

   .....

}