Project Euler and PowerShell - Problem 10

Continuing on with Project Euler, I am momentarily skipping problems 8 (getting that big string into a numeric array still eludes me!) and 9 to quickly do problem 10.

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below two million.

This is another brute force attack. I am sure there is a more efficient algorithm, but the following gets it done.

function isPrime
{
    param ($number)
    $isPrime = $true
    if($number -lt 2) { $isPrime = $False}
    if($number -gt 2 -and $number%2 -eq 0) {$isPrime = $False}
    for($i=3;$i -le [math]::Sqrt($number);$i+=2)
    {
        if($number % $i -eq 0) { $isPrime = $False}
    }   
    $isPrime
}   

$limit=2000000
$sum=2
for($i=3; $i -lt $limit;$i+=2)
{
    if( isPrime $i)
    {
        $sum+=$i
        "{0}`t{1}" -f $i, $sum
    }
}

While this generates the correct answer, it is painfully slow. I will be revisiting this one in an attempt to optimize it.