Question Number 2878 by Yozzi last updated on 29/Nov/15

Commented by prakash jain last updated on 29/Nov/15

Answered by prakash jain last updated on 29/Nov/15

Answered by Rasheed Soomro last updated on 30/Nov/15
![Let 7^m ≡r(mod 5) Experimenting and Observing for values of m and r: 7^((0,1,2,3,4,5,6,...)) ≡(1,2,4,3,1,2,4,...) (mod 5) Generalizing: 7^(4k) ≡1(mod 5) ∥ 7^(4h+2) ≡4(mod 5) 7^(4k+1) ≡2(mod 5) ∥ 7^(4h+3) ≡3(mod 5) 7^(4k+2) ≡4(mod 5) ∥ 7^(4h) ≡1(mod 5) 7^(4k+3) ≡3(mod 5) ∥ 7^(4h+1) ≡2(mod 5) Adding corresponding 7^(4k) +7^(4h+2) ≡0(mod 5) 7^(4k+1) +7^(4h+3) ≡0(mod 5) 7^(4k+2) +7^(4h) ≡0(mod 5) 7^(4k+3) +7^(4h+1) ≡0(mod 5) Four types of ordered pairs [(m,n)] satisfying the given statement. 1≤(4k,4h+2)≤100 1≤(4k+1,4h+3)≤100 1≤(4k+2,4h)≤100 1≤(4k+3,4h+1)≤100 Now it′s easy to count Suppose there are x 4k+1 type numbers between 1 and 100 inclusive and y 4h+3 type numbers between 1 and 100 inclusive THEN There are xy ordered pairs of such numbers. A multiplicational table is easy way of recording and counting all required (m,n)′s](https://www.tinkutara.com/question/Q2893.png)
Commented by prakash jain last updated on 29/Nov/15

Commented by Rasheed Soomro last updated on 29/Nov/15
