Home
Class 14
MATHS
Find the remainder when (3)^(162) is div...

Find the remainder when `(3)^(162)` is divided by 162.

A

1

B

81

C

150

D

100

Text Solution

AI Generated Solution

The correct Answer is:
To find the remainder when \(3^{162}\) is divided by 162, we can use the Chinese Remainder Theorem (CRT) since 162 can be factored into its prime components. 1. **Factor 162**: \[ 162 = 2 \times 81 = 2 \times 3^4 \] 2. **Find \(3^{162} \mod 2\)**: - Since \(3\) is odd, \(3^{162} \mod 2 = 1\). 3. **Find \(3^{162} \mod 81\)**: - We can use Euler's theorem here. First, we need to find \(\phi(81)\): \[ \phi(81) = 81 \left(1 - \frac{1}{3}\right) = 81 \times \frac{2}{3} = 54 \] - According to Euler's theorem, since \(3\) and \(81\) are coprime: \[ 3^{54} \equiv 1 \mod 81 \] - Now, we need to reduce \(162\) modulo \(54\): \[ 162 \mod 54 = 0 \] - Therefore: \[ 3^{162} \equiv (3^{54})^3 \equiv 1^3 \equiv 1 \mod 81 \] 4. **Now we have the two congruences**: \[ 3^{162} \equiv 1 \mod 2 \] \[ 3^{162} \equiv 1 \mod 81 \] 5. **Using the Chinese Remainder Theorem**: - We need to solve the system: \[ x \equiv 1 \mod 2 \] \[ x \equiv 1 \mod 81 \] - The solution to this system is: \[ x \equiv 1 \mod 162 \] 6. **Final Remainder**: - Since both congruences give us the same result, the remainder when \(3^{162}\) is divided by \(162\) is: \[ \text{Remainder} = 1 \] Thus, the final answer is that the remainder when \(3^{162}\) is divided by \(162\) is **1**.
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 remiander when (3)^(162) is divided by 162.

Find the remainder when (3)^(152) is divided by 15.

Find the remainder when (3)^(555) is divided by 7.

Find the remainder when (3)^(2140) is divided by 17.

Find the remainder when (2)^(111) is divided by 9.

Find the remainder when (2)^(51) is divided by 5.

Find the remainder when (2)^(51) is divided by 5.

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

    Text Solution

    |

  2. Find the remainder when (25)^(30) is divided by 26.

    Text Solution

    |

  3. Find the remainder when (3)^(162) is divided by 162.

    Text Solution

    |

  4. Find the remainder when (5)^(250) is divided by 250.

    Text Solution

    |

  5. When the remainder when (9)^(11) is divided by 11.

    Text Solution

    |

  6. Find the remainder when (2)^(51) is divided by 5.

    Text Solution

    |

  7. Find the remainder when (2)^(51) is divided by 5.

    Text Solution

    |

  8. Find the remainder when (3)^(2140) is divided by 17.

    Text Solution

    |

  9. Find the remainder when (2)^(111) is divided by 9.

    Text Solution

    |

  10. Find the remainder when (2)^(5555) is divided by 13.

    Text Solution

    |

  11. Find the remainder when (3)^(152) is divided by 15.

    Text Solution

    |

  12. Find the remainder when (3)^(555) is divided by 7.

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |