Prove that for any number
The way I approached it was by linear combinations
At this point I get stuck. I kind of wish there were some way of saying since it was a linear combination of 5,3, and 2 the gcd of the three must be one.
Follow Math Help Forum on Facebook and Google+
Just note that since 10=5x2, you may want to have a look at (10n+3)-2(5n+2) that's a common method : find a linear combination that cancels n and the result will be a multiple of the gcd!
Thank you so much. I didn't think of just picking a combination. I always thought I needed to deal with them in the abstract *wavy hands*
View Tag Cloud