First let the number be N,to find the last two digits,"lets" hunt the last tree from the given number, we must find the remainder from the division N/1000.Analysing module 8 and module 125 we have: First module 8, 2014 = 8∙251 + 6, N ≡ (1∙3∙5∙7)^251 ∙1∙3∙5 ,as every 8 odd numbers we have their product ≡1*3*5*7*1*3*5*7(mód 8),N≡1^251 ∙7≡7. Now module 125, we have that 125 is one fator of N ,so N ≡0 (mód 125). N = 125t ≡ 7 (mód 8),5t +8≡ 15 (mód 8),then t ≡ 3 (mód 8). Hence t = 8k + 3 and N = 125(8k + 3) = 1000k + 375 ≡ 375 (mód 1000). The last 3 digits from N are 375.So the last 2 are 75.