Sign in
12thPass logo
New chatPYQ LibraryDoubtsRank report
Sign in to see Recents

Your guest activity stays on this device

Sign in to save progress →
Sign in

Binomial Theorem question

2023 · 30 Jan · Shift 2 · Q44
Guest · filters and generic practice availableBrowsing as a guest · PYQ filters and generic practice are available. Sign in only for personalised features and saved progress.
  1. PYQ Library
  2. /JEE Main
  3. /Mathematics
  4. /Binomial Theorem
  5. /2023 · 30 Jan · Shift 2 · Q44

Binomial Theorem question

2023 · 30 Jan · Shift 2 · Q44

JEE MainMathematicsBinomial TheoremNumerical+4 / −1
50th 50^{\text {th }}50th  root of a number xxx is 12 and 50th 50^{\text {th }}50th  root of another number yyy is 18 . Then the remainder obtained on dividing (x+y)(x+y)(x+y) by 25 is ‾\underline{\hspace{2cm}}​.
Numerical answer
View written solutionFree

Correct answer: 23

  1. From the statement, x50=12⇒x=1250\sqrt[50]{x}=12 \quad \Rightarrow \quad x=12^{50}50x​=12⇒x=1250 and y50=18⇒y=1850.\sqrt[50]{y}=18 \quad \Rightarrow \quad y=18^{50}.50y​=18⇒y=1850.

  2. We need the remainder when x+y=1250+1850x+y=12^{50}+18^{50}x+y=1250+1850 is divided by 252525.

  3. So compute modulo 252525: 1250+1850(mod25).12^{50}+18^{50} \pmod{25}.1250+1850(mod25).

  4. Reduce the bases modulo 252525: 18≡−7(mod25).18 \equiv -7 \pmod{25}.18≡−7(mod25). Also, notice that powers modulo 252525 can be simplified using Euler's theorem: ϕ(25)=20.\phi(25)=20.ϕ(25)=20. Since gcd⁡(12,25)=1\gcd(12,25)=1gcd(12,25)=1 and gcd⁡(18,25)=1\gcd(18,25)=1gcd(18,25)=1, 1220≡1(mod25),1820≡1(mod25).12^{20} \equiv 1 \pmod{25}, \qquad 18^{20} \equiv 1 \pmod{25}.1220≡1(mod25),1820≡1(mod25).

  5. Now, 50=20⋅2+10,50=20\cdot 2+10,50=20⋅2+10, so 1250=1240⋅1210≡1⋅1210=1210(mod25),12^{50}=12^{40}\cdot 12^{10} \equiv 1\cdot 12^{10}=12^{10} \pmod{25},1250=1240⋅1210≡1⋅1210=1210(mod25), 1850=1840⋅1810≡1⋅1810=1810(mod25).18^{50}=18^{40}\cdot 18^{10} \equiv 1\cdot 18^{10}=18^{10} \pmod{25}.1850=1840⋅1810≡1⋅1810=1810(mod25).

  6. Compute 1210(mod25)12^{10} \pmod{25}1210(mod25): 122=144≡19(mod25).12^2=144 \equiv 19 \pmod{25}.122=144≡19(mod25). Then 124≡192=361≡11(mod25),12^4 \equiv 19^2=361 \equiv 11 \pmod{25},124≡192=361≡11(mod25), 128≡112=121≡21(mod25).12^8 \equiv 11^2=121 \equiv 21 \pmod{25}.128≡112=121≡21(mod25). Therefore, 1210=128⋅122≡21⋅19=399≡24(mod25).12^{10}=12^8\cdot 12^2 \equiv 21\cdot 19=399 \equiv 24 \pmod{25}.1210=128⋅122≡21⋅19=399≡24(mod25).

  7. Compute 1810(mod25)18^{10} \pmod{25}1810(mod25): 182=324≡24(mod25).18^2=324 \equiv 24 \pmod{25}.182=324≡24(mod25). Then 184≡242=576≡1(mod25).18^4 \equiv 24^2=576 \equiv 1 \pmod{25}.184≡242=576≡1(mod25). Hence, 1810=188⋅182=(184)2⋅182≡12⋅24=24(mod25).18^{10}=18^8\cdot 18^2=(18^4)^2\cdot 18^2 \equiv 1^2\cdot 24=24 \pmod{25}.1810=188⋅182=(184)2⋅182≡12⋅24=24(mod25).

  8. Add the remainders: 1250+1850≡24+24=48≡23(mod25).12^{50}+18^{50} \equiv 24+24=48 \equiv 23 \pmod{25}.1250+1850≡24+24=48≡23(mod25).

  9. Therefore, the remainder on dividing (x+y)(x+y)(x+y) by 252525 is 23.\boxed{23}.23​.

PreviousNext

More from Binomial Theorem

  • The remainder on dividing 599 by 11 is ​.2023 · Numerical
  • Let α>0, be the smallest number such that the expansion of (x32​+x32​)30 has a term βx−α,β∈N. Then α is equal to ​.2023 · Numerical
  • The coefficient of x−6, in the expansion of (54x​+2x25​)9, is2023 · Numerical
  • If the constant term in the binomial expansion of (2x25​​−xl4​)9 is −84 and the coefficient of x−3l is 2αβ, where β<0 is an odd number, then ∣αl−β∣…2023 · Numerical
  • The remainder when 32022 is divided by 5 is :2022 · MCQ
  • The remainder on dividing 1 + 3 + 32 + 33 + ..... + 32021 by 50 is ​.2022 · Numerical
  • If the maximum value of the term independent of t in the expansion of (t2x51​+t(1−x)101​​)15,x⩾0, is K, then 8 K is equal to ​…2022 · Numerical
  • The remainder when (11)1011+(1011)11 is divided by 9 is2022 · MCQ