General

Chat

Math Extra-Credit Help

"Find the smallest possible positive integer that is divisible by 13, and that, when divided by any of the integers from 2-12, leaves a remainder of 1"

I tried actually writing out which #'s would fit into what the word problem stated, but I realized it was going to take forever.

is there an easier method to solving this ?

March 29, 2012

1 Comment • Newest first

tyranittar

you could try working backwards starting with the 1.

Reply March 29, 2012