13*d = 1 mod 60 PLEASE WITH STEPS I WILL GIVE BRAINLIST​

Step-by-step explanation:

Modulo can be read as:

For , what is the remainder when is divide by ?

Therefore, we're looking for a number that when divided by 60 returns a remainder of 1.

Compare multiples of 13 and 60 to find a pair where the multiple of 13 is exactly 1 greater than the multiple of 60.

After some digging, we find that

Therefore, we can substitute with :

Since there are clearly more than one number that when divided by 60 returns a remainder of 1, any valid answer 60 will also be a valid answer. Therefore, , for all real numbers .

answer: all of the odd numbers were opened

the first person was the one that was opening all of the lockers. since one is odd, this causes all of the odd number lockers to be opened in the end.

you have to wait a while to reward brainliest if only one person answers. if 2 people answer there should be a "mark brainliest" on their question.

i cant fully remember all of the ranks, here are the ones i remember.

hand, ambitous, ace, genius.