I have the following algorithm to calculate the primes from 2 up to a given number:

```
pub fn primes_up_to(upper_bound: u64) -> Vec<u64> {
let mut primes: Vec<u64> = vec![];
let mut nums: Vec<_> = (2..=upper_bound).collect();
while let Some(&prime) = nums.iter().next() {
primes.push(prime);
nums = nums.into_iter().filter(|&x| x % prime != 0).collect();
}
primes
}
```

and I would like to simplify the code in this way:

```
pub fn primes_up_to(upper_bound: u64) -> Vec<u64> {
let mut primes: Vec<u64> = vec![];
let nums = 2..=upper_bound;
while let Some(prime) = nums.next() {
primes.push(prime);
// Rust failed to compile this line
nums = nums.filter(|&x| x % prime != 0);
}
primes
}
```

Of course the previous code doesn't compile. Rust throws the following error:

```
nums = nums.filter(|&x| x %prime);
^^^^^^^^^^^^^^^^^^^^^^^^^^ expected struct `std::ops::RangeInclusive`, found struct `std::iter::Filter`
```

But, is it possible to fix in some way the previous code so that it can be compiled?