## Complete residue system Question

Hi i am doing self-study of number theory as it looks interesting and enlightening.
Can someone help because I encounter a problem here..
Suppose A = {a1,a1,,,,,,,ak} is a complete residue system modulo k. Prove that for each integer n and each nonnegative integer s there exists a congruence of the form
n ≡ (sum j=0 to s)bj kj ( mod ks+1 )
where bj$$\in$$ A for each j .
 PhysOrg.com science news on PhysOrg.com >> Galaxies fed by funnels of fuel>> The better to see you with: Scientists build record-setting metamaterial flat lens>> Google eyes emerging markets networks
 Recognitions: Homework Help Science Advisor a_1 and a_k are relatively prime, so you can use the extended Euclidean algorithm to find constants A and B with Aa_1 + Ba_k = 1. Then take (An)a_1 + (Bn)a_k.