JEE Main & Advanced Mathematics Binomial Theorem and Mathematical Induction Question Bank Mathematical induction and Divisibility problems

  • question_answer
    When \[{{2}^{301}}\] is divided by 5, the least positive remainder is [Karnataka CET 2005]

    A) 4

    B) 8

    C) 2

    D) 6

    Correct Answer: C

    Solution :

     \[{{2}^{4}}\equiv 1\](mod 5);\[\Rightarrow {{({{2}^{4}})}^{75}}\equiv {{(1)}^{75}}\](mod5) i.e. \[{{2}^{300}}\equiv 1\] (mod 5) \[\Rightarrow {{2}^{300}}\times 2\equiv (1.2)\](mod 5) \[\Rightarrow {{2}^{301}}\equiv 2\] (mod 5), \[\therefore \] Least positive remainder is 2.


You need to login to perform this action.
You will be redirected in 3 sec spinner