Question

Help!

Answer 1

Find the smallest positive N such that \[N \equiv 3 \pmod{4} \]\[N \equiv 2 \pmod{5}\]\[N \equiv 6 \pmod{7}. \]

Answer 2

Yeah, I do a lot of these questions.

Answer 3

27 is the smallest n for the first 2.

it is also 6 mod 7

Answer 4

Sorry for the late reply. Yeah that's right! Thanks!

Answer 5

Oh god number theory.

Answer 6

I know right?

Answer 7

It's been forever since I did number theory, but I used to really like it. I seem to have pretty much forgotten it all, lol. But I tried to plug through this one using an example I found online as a reference, I don't really think that I did it right but I'd like to see what you get if you figure it out!