Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,844 questions

51,765 answers

573 users

How to find the prime factors of a number in Swift

1 Answer

0 votes
import Foundation

func getPrimeFactors(_ n: Int) -> [Int] {
    var factors: [Int] = []
    var number = n
    var divisor = 2

    while number >= 2 {
        if number % divisor == 0 {
            factors.append(divisor)
            number /= divisor
        } else {
            divisor += 1
        }
    }

    return factors
}

let testNumbers = [124, 288, 1288]
for n in testNumbers {
    let result = getPrimeFactors(n).map { String($0) }.joined(separator: " x ")
    print("\(n) = \(result)")
}



/*
run:

124 = 2 x 2 x 31
288 = 2 x 2 x 2 x 2 x 2 x 3 x 3
1288 = 2 x 2 x 2 x 7 x 23

*/

 



answered Jul 29, 2025 by avibootz
edited Jul 31, 2025 by avibootz
...