Q. Solution Video

A teacher brought a bag of candy containing n (n >13) n(n>13) pieces to distribute to her 13
13 students. Ensuring that each student received an equal number of pieces of candy, she returned home 11 pieces.

This is a question within the “Practice Questions”. In the explanation video, you mention that one could solve this by “Picking numbers” or algebraically. Then you elaborate on how to solve it with picking numbers. I could not think of a good way to solve this algebraically, could you give me a short hint how to solve this algebraically?

Consider mod 13.

That is, all valid values of n are of the form: n = 13k + r

where:

  • \quad k \in \mathbb{N}
  • \quad r \in \{0, 1, 2, \dots, 12\}.

Also fyi, post the actual question cuz rn there isn’t one.