Question Number 15292 by RasheedSoomro last updated on 09/Jun/17

Answered by RasheedSoomro last updated on 11/Jun/17
![100! has 24 0′s from right. p=((100!)/(10^(24) )) has no zero at the end. ∴ First non-zero digit of 100! =unit digit of p ∴ p≡d(mod 10) Simplifying p=((100!)/(10^(24) ))=((100!)/(2^(24) ×5^(24) )) 10^(24) =2^(24) ×5^(24) =2^(6•) (5.10.15...100) All the 24 5′s have come in 5.10...100 ^• Also some 2′s have come: One 2 in each multiple of 10 10 2′s One 2 extra in each multiple of 20 5 2′s One 2 extra in each multiple of 40 2 2′s One 2 extra in each multiple of 80 1 2′s _(−) Total(included in 5.10...100) 18 2′s Remaining 24−18=6 So now p=((100!)/(10^(24) ))=((100!)/(2^(24) ×5^(24) ))=((100!)/(2^6 (5.10....100))) p=(1/(2.2^5 )){(1.2.3.4)(6.7.8.9)...(96.97.98.99} p={(((1.2.3.4)/2))(6.7.8.9).(11.12.13.14)(((16.17.18.19)/2))} ×{(21.22.23.24)(26.27.28.29).(31.32.33.34)(((36.37.38.39)/2))} ...×{(81.82.83.84)(86.87.88.89).(91.92.93.94)(((96.97.98.99)/2))} Account of 2^6 : One 2 comes in read bracket 5 2′s come in five blue brackets (one blue bracket is per each 20) Now we can verify/prove the following congruences: ((1.2.3.4)/2)≡2(mod 10) {: ((6.7.8.9)),(⋮),((91.92.93.94)) }≡4(mod 10) [14 congruencs] (5k+1)(5k+2)(5k+3)(5k+4)≡4(mod 10) { ((^• See Answer of mrW1 ⌉)),((to Q#14614 or an)),(( alternative proof in)),((the comment below.)) :} {: (((16.17.18.19)/2)),(⋮),(((96.97.98.99)/2)) }≡2 [5 congruences] {(5k+1)(5k+2)(5k+3)(5k+4)}/2≡4(mod 10) { ((^∗ Fo proof see the)),((comment below.)) :} Multiplying all the above congruences p≡2.4^(14) .2^5 (mod 10) 4^(14) ≡6(mod 10) [4^(2k) ≡6(mod 10)] 2^5 ≡32≡2(mod 10) p≡2.6.2(mod 10) p≡4(mod 10) Hence the require non-zero digit is 4 It′s only accedent that the answer is correct! Actually there′s a fault in the logic. I′ll try to correct my logic. Please stay with me!](https://www.tinkutara.com/question/Q15296.png)
Commented by RasheedSoomro last updated on 09/Jun/17

Commented by mrW1 last updated on 09/Jun/17
![(5k+1)(5k+2)(5k+3)(5k+4) =(5k+1)(5k+4)(5k+3)(5k+2) = [(5k)^2 +5(5k)+4][(5k)^2 +5(5k)+6] =[(5k)^2 +5(5k)]^2 +10[(5k)^2 +5(5k)]+24 =625[k(k+1)]^2 +250[k(k+1)]+24 =2500[((k(k+1))/2)]^2 +500[((k(k+1))/2)]+24 since one of k and k+1 is even, ((k(k+1))/2) is integer ⇒4 (mod 10)](https://www.tinkutara.com/question/Q15315.png)
Commented by RasheedSoomro last updated on 09/Jun/17

Commented by mrW1 last updated on 09/Jun/17

Commented by RasheedSoomro last updated on 09/Jun/17

Commented by mrW1 last updated on 09/Jun/17

Commented by prakash jain last updated on 10/Jun/17

Commented by RasheedSoomro last updated on 10/Jun/17

Answered by RasheedSoomro last updated on 11/Jun/17
![Easy way 100! has 24 0′s from right. p=((100!)/(10^(24) )) has no zeo from right ∴ first non-zero digit in 100! from right = unit digit in p ∴ p≡d(mod 10) p=((100!)/(10^(24) ))=((100!)/(2^(24) ×5^(24) ))=((100!)/(2^6 (5.10....100))) [18 2′s from 2^(24) have come in 5.10....100] =(1/2^6 ){(1.2.3.4)(6.7.8.9)...(96.97.98.99} p≡d(mod 10)⇒ (1/2^6 ){(1.2.3.4)(6.7.8.9)...(96.97.98.99}≡d(mod 10) (1/2^6 )(4)^(20) ≡d(mod 10) [∵ Each bracket≡4(mod 10) Total brackets=20] (2^(40) /2^6 )≡d(mod 10) d≡2^(34) (mod 10) Verify that: 2^4 ≡6(mod 10 (2^4 )^8 ≡6^8 ≡6(mod 10) 2^(32) .2^2 ≡6.2^2 ≡4(mod 10) 2^(34) ≡4(mod 10) Hence d≡2^(34) ≡4(mod 10) d≡4(mod 10) Wrong logic! Accedently correct answer! I′ll try to correct my logic. Please stay with me!](https://www.tinkutara.com/question/Q15424.png)
Answered by RasheedSoomro last updated on 11/Jun/17
![According to Corrected Logic. Right logic & Right answer Expansion of 100! have 24 0′s in the right. Let p=((100!)/(10^(24) )) p has no zero from right. First non-zero digit in 100! =unit digit in p d≡p(mod 10) p=((100!)/(10^(24) ))=((100!)/(2^(24) ×5^(24) )) =((100!)/(2^(24) ×(5×((10)/2)×((15)/3)×((20)/2^2 )×5^2 ×...×((100)/2^2 )))) =((100!)/(2^(24) ×(((5.10.15.....100)/(2^(18) ×3^8 ×7^2 ×11×13×17×19))))) =3^8 ×7^2 ×11×13×17×19×((100!)/(2^6 (5.10....100))) =3^8 ×7^2 ×11×13×17×19{(((1...4)/2))(6...9)(11...14)(((16....19)/2))} ×...×{(81....84)(86...89)(91...94)(((96...99)/2))} Number of red bracket= 1 Number of black brackets= 14 3 per each 20 except first. Number of blue brackets= 5 1 per each 20 We can verify/prove the following congruences 3^8 ≡1(mod 10) 7^2 ≡9(mod 10) 11≡1(mod 10) 13≡3(mod 10) 17≡7(mod 10) 19≡9(mod 10) ((1.2.3.4)/2)≡2 Any of Black-bracket≡4(mod 10) [14 congruences] Any of Blue-bracket≡2(mod 10) [ 5 congruences] Multiplying all above congruences p≡1.9.1.3.7.9.2.4^(14) .2^5 (mod 10) p≡1.9.1.3.7.9.2.6.2(mod 10) [∵4^(even) ≡6(mod 10] p≡40824≡4(mod 10) [∵4^(even) ≡6(mod 10]](https://www.tinkutara.com/question/Q15515.png)