Hi,

as a little fun project I wrote this prime generator. It is not fully correct because I assume that 1 is not prime and 2 is prime.

```
fn main() {
let mut primes = Vec::new();
primes.push(2);
let mut found = false;
for n in 3..100 {
for prime in &primes {
if n % prime == 0 {
found = true;
break;
}
}
if found == false {
primes.push(n);
}
found = false;
}
println!("{:?}", primes);
}
```

Because it is a bit straight forward and I want to learn to write better Rust code maybe someone might help me to make this more idiomatic Rust. Don't be confused with the `found`

variable. It means that I found a number that is NOT prime

Regards

Markus