Sieve of Eratosthenes' method to find prime numbers up to a give number N

SieveOfEratosthenes.swift

/*
https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
The sieve of Eratosthenes is one of the most efficient way to find all prime numbers up to any given limit. 
It's a simple and ancient algorithm that is know for it's performance. Here is a swift flavor of this algorithm.
*/
func sieveOfEratosthenes(number n: UInt) -> [UInt] {
    
    var list = Array(2...n)
    
    list = list.filter {
        // base case, if the value is equal to 2, 3 or 5
        if $0 == 2 || $0 == 3 || $0 == 5 {
            return true
        }
        // if the value is not multiple of 2, 3 or 5
        else {
            return $0 % 2 != 0 && $0 % 3 != 0 && $0 % 5 != 0
        }
    }
    
    return list
}

let primeNumbers = sieveOfEratosthenes(number: 100000)
print(primeNumbers)

This is wrong implementation.