Page 1 of 1
Using the functional programming language RACKET solve the following problem: The prime-factors function takes an intege
Posted: Sun May 15, 2022 8:13 am
by answerhappygod
- Using The Functional Programming Language Racket Solve The Following Problem The Prime Factors Function Takes An Intege 1 (24.71 KiB) Viewed 49 times
Using the functional programming language RACKET solve the following problem: The prime-factors function takes an integer n as input (n ¿O) and returns a list containing the prime factors of n in ascending order. Prime factors are the prime numbers that divide a number exactly. If all the prime factors are multiplied, the original number is obtained. Examples: (prime-factors 1) → () (prime-factors 6) → (23) (prime-factors 96) → (2 2 2 2 2 3) (prime-factors 97) (97) (prime-factors 666) → (2 3 3 37)