Guys please help with this hard Algebra 2 question?

Question

Ok well I kind of need help on this algebra II questions! Please answer if you are serious!
Ok you’re at a really large school, and there are 1,000 closed lockers in a straight hallway. Devin decides that he’s going to opens every other locker. Bryce decides that he is going to change the state (if its open close it, if it’s closed open it) of every third locker. Ethan decides that he’s going to change the state of every fourth locker. This continues on until the 1,000th locker. Which locker will be open? How many will be closed? Which locker will be open by the end? Thank you so much! BTW this is not my homework! Oh and plz answer if you can help me!

Answer 1

This is a logic problem involving prime numbers.

Nobody touches locker one.
Only one person touches locker two: Devin.
Only one person touches locker three: Bryce
Two people touch locker four: Devin and Ethan
Nobody touches locker five.
Two people touch locker 6: devin and bryce
Nobody touches locker seven
Two people touch locker 8: Devin and Ethan
One person touches locker 9: Bryce
One peson touches locker 10: Devin
Nobody touches locker 11.

All prime numbers above 4 are untouched.
Can you tell which numbers are touched only once?
Can you tell which are touched only twice?

Is this enough of a hint to work from?

Here is some MatLab source code:
x=1:1000;
y=ones(size(x))
for i=2:4
for j=i:i:length(x)
y(j)=not(y(j));
end
end

sum(y)

The output of the source code is 583. Is that helpful? Is that open doors, closed doors, or something else?

Here is some more source code:
x=1:1000;
y=ones(size(x))
for i=2:1000
for j=i:i:length(x)
y(j)=not(y(j));
end
end

sum(y)

Its output is only 31. What does that mean?

Answer 2

probably 10 or 15 b/c they would get bored that far into it

Answer 3

wow thats a tough one im sorry but i cant help but good luck!