I'm getting 266333, but that isn't the right answer. I don't see the flaw in my algorithm, though.

```
    int count = 0;
    for (int i = 0; i < 1000; i=i+3) {
        count = count + i;
    }

    for (int i = 0; i < 1000; i=i+5) {
        count = count + i;
    }

    System.out.println(count);

```

EDIT: I posted this because I saw other algorithms using modulus, but not approaching it this way. I felt like this theory was valid, but I was missing a piece.