5 added 10 characters in body

PowerShell 47 44

# PowerShell, 47 44 bytes

Very slow, but the shortest I could come up with.

$p=2..1e6;$p|?{$n=$_;!($p-lt$_|?{!($n%$_)})}


PowerShell 123

# PowerShell, 123 bytes

This is much faster; far from optimal, but a good compromise between efficiency and brevity.

 $p=2..1e6;$n=0
while(1){$p=@($p[0..$n]|?{$_})+($p[($n+1)..($p.count-1)]|?{$_%$p[$n]});$n++;if($n-ge($p.count-1)){break}}$p


PowerShell 47 44

Very slow, but the shortest I could come up with.

$p=2..1e6;$p|?{$n=$_;!($p-lt$_|?{!($n%$_)})}


PowerShell 123

This is much faster; far from optimal, but a good compromise between efficiency and brevity.

 $p=2..1e6;$n=0
while(1){$p=@($p[0..$n]|?{$_})+($p[($n+1)..($p.count-1)]|?{$_%$p[$n]});$n++;if($n-ge($p.count-1)){break}}$p


# PowerShell, 47 44 bytes

Very slow, but the shortest I could come up with.

$p=2..1e6;$p|?{$n=$_;!($p-lt$_|?{!($n%$_)})}


# PowerShell, 123 bytes

This is much faster; far from optimal, but a good compromise between efficiency and brevity.

 $p=2..1e6;$n=0
while(1){$p=@($p[0..$n]|?{$_})+($p[($n+1)..($p.count-1)]|?{$_%$p[$n]});$n++;if($n-ge($p.count-1)){break}}$p

4 added 17 characters in body

PowerShell 4747 44

Very slow, but the shortest I could come up with.

$p=2..1e6;while($p)1e6;$p|?{$p[0];$p=@$n=$_;!($p|$p-lt$_|?{$_%$p[0]!($n%$_)})}


PowerShell 123

This is much faster; far from optimal, but a good compromise between efficiency and brevity.

 $p=2..1e6;$n=0
while(1){$p=@($p[0..$n]|?{$_})+($p[($n+1)..($p.count-1)]|?{$_%$p[$n]});$n++;if($n-ge($p.count-1)){break}}$p


PowerShell 47

Very slow, but the shortest I could come up with.

$p=2..1e6;while($p){$p[0];$p=@($p|?{$_%$p[0]})}  PowerShell 123 This is much faster; far from optimal, but a good compromise between efficiency and brevity. $p=2..1e6;$n=0 while(1){$p=@($p[0..$n]|?{$_})+($p[($n+1)..($p.count-1)]|?{$_%$p[$n]});$n++;if($n-ge($p.count-1)){break}}
$p  PowerShell 47 44 Very slow, but the shortest I could come up with. $p=2..1e6;$p|?{$n=$_;!($p-lt$_|?{!($n%$_)})}  PowerShell 123 This is much faster; far from optimal, but a good compromise between efficiency and brevity. $p=2..1e6;$n=0 while(1){$p=@($p[0..$n]|?{$_})+($p[($n+1)..($p.count-1)]|?{$_%$p[$n]});$n++;if($n-ge($p.count-1)){break}}
$p  3 Changed upper limit to scientific notation. PowerShell 5047 Very slow, but the shortest I could come up with. $p=2..999997;while1e6;while($p){$p[0];$p=@($p|?{$_%$p[0]})}


PowerShell 126123

This is much faster; far from optimal, but a good compromise between efficiency and brevity.

 $p=2..999997;$n=01e6;$n=0 while(1){$p=@($p[0..$n]|?{$_})+($p[($n+1)..($p.count-1)]|?{$_%$p[$n]});$n++;if($n-ge($p.count-1)){break}}
$p  PowerShell 50 Very slow, but the shortest I could come up with. $p=2..999997;while($p){$p[0];$p=@($p|?{$_%$p[0]})}


PowerShell 126

This is much faster; far from optimal, but a good compromise between efficiency and brevity.

 $p=2..999997;$n=0
while(1){$p=@($p[0..$n]|?{$_})+($p[($n+1)..($p.count-1)]|?{$_%$p[$n]});$n++;if($n-ge($p.count-1)){break}}$p


PowerShell 47

Very slow, but the shortest I could come up with.

$p=2..1e6;while($p){$p[0];$p=@($p|?{$_%$p[0]})}  PowerShell 123 This is much faster; far from optimal, but a good compromise between efficiency and brevity. $p=2..1e6;$n=0 while(1){$p=@($p[0..$n]|?{$_})+($p[($n+1)..($p.count-1)]|?{$_%$p[$n]});$n++;if($n-ge($p.count-1)){break}}
\$p

2 Found shorter version
1