For two numbers a and b, if we can find numbers q and r such that a=bq+r, then we say that b divides a with q as quotient and r as remainder. Thus, in order to show that 6n−5n leaves remainder 1 when divided by 25 , we prove that 6n−5n=25k+1, where k is some natural number.
We have, (1+a)n=nC0+nC1a+nC2a2+…+nCnan
For a=5, we get (1+5)n=nC0+nC15+nC252+…+nCn5n
i.e., (6)n=1+5n+52⋅nC2+53⋅nC3+…+5n
i.e., 6n−5n=1+52(nC2+nC35+…+5n−2)
or 6n−5n=1+25(nC2+5⋅nC3+…+5n−2)
or 6n−5n=25k+1, where k=nC2+5⋅nC3+…+5n−2
This shows that when divided by 25,6n−5n leaves remainder 1.