OK. I posted this in the wrong place to begin with as well as phrased it wrong. I am trying to better understand the Sieve of Eratosthenes problem. It needs to have values v=0, v=1...v[n]=n. It needs to find the prime numbers and delete the locations of the numbers that are not prime. Does anyone have a version of this that I can mess around with? I understand the logic, I am just having a TON of syntactic issues... :/ Any help would be great.