Home
Class 14
MATHS
Find the remainder when (777777 …… 1000 ...

Find the remainder when (777777 …… 1000 times) is divided by 13.

A

10

B

3

C

4

D

5

Text Solution

AI Generated Solution

The correct Answer is:
To find the remainder when the number formed by repeating "777" a total of 1000 times is divided by 13, we can follow these steps: ### Step 1: Understand the structure of the number The number we are dealing with is "777" repeated 1000 times. This can be expressed as: \[ N = 777777... \text{ (1000 times)} \] ### Step 2: Break down the number Since "777" is a 3-digit number, we can express \( N \) as: \[ N = 777 \times 10^{3 \times (1000 - 1)} + 777 \times 10^{3 \times (1000 - 2)} + ... + 777 \times 10^0 \] This is a geometric series where the first term \( a = 777 \) and the common ratio \( r = 10^3 = 1000 \). ### Step 3: Calculate the sum of the geometric series The sum \( S \) of the first \( n \) terms of a geometric series can be calculated using the formula: \[ S = a \frac{r^n - 1}{r - 1} \] Here, \( n = 1000 \), \( a = 777 \), and \( r = 1000 \): \[ S = 777 \frac{1000^{1000} - 1}{1000 - 1} = 777 \frac{1000^{1000} - 1}{999} \] ### Step 4: Find the remainder when divided by 13 Instead of calculating \( S \) directly, we can find the remainder of \( 777 \) and \( 1000^{1000} - 1 \) modulo 13. #### Step 4.1: Calculate \( 777 \mod 13 \) First, we find the remainder of \( 777 \) when divided by \( 13 \): \[ 777 \div 13 = 59 \quad \text{(integer part)} \] \[ 59 \times 13 = 767 \] \[ 777 - 767 = 10 \] So, \( 777 \mod 13 = 10 \). #### Step 4.2: Calculate \( 1000^{1000} \mod 13 \) Next, we need to calculate \( 1000 \mod 13 \): \[ 1000 \div 13 = 76 \quad \text{(integer part)} \] \[ 76 \times 13 = 988 \] \[ 1000 - 988 = 12 \] So, \( 1000 \mod 13 = 12 \). Now we need to calculate \( 12^{1000} \mod 13 \). By Fermat's Little Theorem, since \( 12 \equiv -1 \mod 13 \): \[ 12^{12} \equiv 1 \mod 13 \] Thus, \( 12^{1000} \mod 13 \) can be simplified: \[ 1000 \mod 12 = 4 \] So, \[ 12^{1000} \equiv 12^4 \mod 13 \] Calculating \( 12^4 \mod 13 \): \[ 12^2 = 144 \] \[ 144 \mod 13 = 1 \] Thus, \[ 12^4 = (12^2)^2 \equiv 1^2 = 1 \mod 13 \] #### Step 4.3: Combine results Now we have: \[ 1000^{1000} - 1 \equiv 1 - 1 = 0 \mod 13 \] ### Step 5: Final calculation Now substituting back into our sum: \[ S \equiv 777 \cdot 0 \mod 13 \] Thus, \[ S \equiv 0 \mod 13 \] ### Conclusion The remainder when \( N \) (the number formed by repeating "777" 1000 times) is divided by 13 is: \[ \boxed{0} \]
Promotional Banner

Topper's Solved these Questions

  • NUMBER SYSTEM

    ADVANCED MATHS BY ABHINAY MATHS ENGLISH|Exercise MULTIPLE CHOICE QUESTIONS |225 Videos
  • MOCK TEST II

    ADVANCED MATHS BY ABHINAY MATHS ENGLISH|Exercise MCQ|100 Videos
  • PARTNERSHIP

    ADVANCED MATHS BY ABHINAY MATHS ENGLISH|Exercise Questions|26 Videos

Similar Questions

Explore conceptually related problems

Find the remainder when (22222 ……101 times) is divided by 11.

Find the remainder when (19191919 …….. 8 times) is divided by 7.

Find the remainder when 73xx75xx78xx57xx197 is divided by 34.

Using Binomial theorem,find the remainder when 5^(103) is divided by 13.

What is the remainder when 4 ^(1000) is divided by 7?

Find the remainder when 13^(73)+14^(3) is divided by 11.

Find the remainder when x=11^(13^(15…….^(91))) divided by 120.

The remainder when (12^(13) + 23^(13)) is divided by 11:

The remainder when (12^(13) + 23^(13)) is divided by 11 :

ADVANCED MATHS BY ABHINAY MATHS ENGLISH-NUMBER SYSTEM -MULTIPLE CHOICE QUESTIONS
  1. Find the remainder when (3)^(555) is divided by 7.

    Text Solution

    |

  2. Find the remainder when 4^(5^(6^(7^(8^(9^(10)))))) is divided by 6.

    Text Solution

    |

  3. Find the remainder when (777777 …… 1000 times) is divided by 13.

    Text Solution

    |

  4. Find the remainder when (22222 ……101 times) is divided by 11.

    Text Solution

    |

  5. Find the remainder when (19191919 …….. 8 times) is divided by 7.

    Text Solution

    |

  6. What is the remainder when (10 + 10^2 + 10^3 + 10^4 + 10^5) is divided...

    Text Solution

    |

  7. (10^(10)+10^(100)+10^(1000)+ -----+10^10000000000)/(7) find R.

    Text Solution

    |

  8. Find the remainder when 2^(2) + 22^(2) + 222^(2) + …… + (222…… 49 time...

    Text Solution

    |

  9. Prove that 2222^(5555) + 5555^(2222) is divisible by 7 .

    Text Solution

    |

  10. Find the remainder when 32^(32) is divided 3.

    Text Solution

    |

  11. Find the remainder when 32^(32) is divided 5.

    Text Solution

    |

  12. Find the remiander when 32^(32) is divided 6.

    Text Solution

    |

  13. Find the remiander when 32^(32) is divided 7.

    Text Solution

    |

  14. Find the remiander when 32^(32) is divided 9.

    Text Solution

    |

  15. Find the remiander when 32^(32) is divided 10.

    Text Solution

    |

  16. Find the remiander when 32^(32) is divided 10.

    Text Solution

    |

  17. What should be added to 8315945 xx 8315947, so that number will be a p...

    Text Solution

    |

  18. If a expression x + 2374156 xx 2374158 is a perfect square, then find ...

    Text Solution

    |

  19. When a certain number is divided by a certain divisor leaves remainder...

    Text Solution

    |

  20. Find the factor of 3^(41) + 7^(82)

    Text Solution

    |