English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

pls explain the process...dont take help of calculator and do in quick time

2006-07-30 07:20:08 · 4 answers · asked by brainstormer 4 in Science & Mathematics Mathematics

4 answers

5.

Note that 10,000,000,000 ≡ 4 mod 7 (you can work this out by simple long division). Note also that 4^10 ≡ 4 mod 7 (this can be found quickly using exponentiation by squaring). Thus, if x≡4 mod 7, so is x^10, x^100, x^1000... and so on. But since all of the above numbers are (10^10)^(10^k), where k is some integer, all of the above numbers are congruent to 4 mod 7. There are 10 such numbers, so their sum is congruent to 10*4 mod 7, which is 5.

Edit: sorry, I messed up the properties of exponents on my first posting. Proof is valid now.

2006-07-30 07:33:11 · answer #1 · answered by Pascal 7 · 1 0

100 Divided By 10

2016-10-07 00:34:08 · answer #2 · answered by ? 4 · 0 0

10 divided by 7 remainder 3
10^3 divided by 7 remainder 3^3 or 27 or 6 or -1
Now:
10^10 divided by 7 remainder (-1)^3*10 or -10 or -3 or 4
10^100 divided by 7 remainder (10^3)^33*10 or -10 or 4
10^1000 divided by 7 remainder (10^3)^333*10 or -10 or 4
...
10^10000000000 divided by 7 remainder (10^3)^3333333333*10 or -10 or 4
So total we have
10^10 + ... + 10^10000000000 divided by 7 remainder 4*10 or 40 or 5
My answer: 5

2006-07-30 07:57:10 · answer #3 · answered by Anonymous · 2 0

10=3mod7
further
10^10=3^10mod7
3^10=-3mod7
3^100=-3^10=-3mod7
and so on

hence required sum S is
(-3+-3+-3..10 times)mod 7
or -30 mod 7
or 5mod7

Hence remainder 5.

2006-07-30 16:10:06 · answer #4 · answered by plzselectanotherone 2 · 1 0

fedest.com, questions and answers