prime-f

(define (prime-factorization n)
  (define (prime-f n)
    (define (prime? n)
      (define (prime-h m)
        (define sqr (sqrt n))
        (cond ((= n 1) #f)
              ((> m sqr) #t)
              ((= (remainder n m) 0) #f)
              (else (prime-h (+ m 1))))
       )
      (prime-h 2)
    )
    (define (prime-f-h i n)
      (cond ((= n 1) '())
            ((and (prime? i) (= (remainder n i) 0)) (cons i (prime-f-h i (/ n i))))
            (else (prime-f-h (+ i 1) n)))
    )
     (prime-f-h 2 n)
    )
  (define (rle l)
    (define (rle-h lst elem count)
      (cond ((null? lst) (list (cons elem count)))
            ((= elem (car lst)) (rle-h (cdr lst) elem (+ count 1)))
            (else (cons (cons elem count) (rle-h (cdr lst) (car lst) 1))))
     )
    (rle-h (cdr l) (car l) 1)
  )
  (if (or (= n 0) (= n 1))
    '()
    (rle (prime-f n)))
)