Scribd
Upload
22 views1 page

CDS Solved Questions

The document presents solutions to two math questions. The first question involves finding the remainder of 65^99 when divided by 11, resulting in a remainder of 10. The second question determines the largest number that divides both 2^35 - 1 and 2^91 - 1, which is 127.

Uploaded by

VAIBHAV Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views1 page

CDS Solved Questions

The document presents solutions to two math questions. The first question involves finding the remainder of 65^99 when divided by 11, resulting in a remainder of 10. The second question determines the largest number that divides both 2^35 - 1 and 2^91 - 1, which is 127.

Uploaded by

VAIBHAV Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Solved CDS Math Questions

Question: What is the remainder when 65^99 is divided by 11?


Options: (a) 0 (b) 5 (c) 9 (d) 10
Solution:
Step 1: Reduce base modulo 11
65 mod 11 = 10
So, 65^99 ? 10^99 mod 11

Step 2: Use cyclicity of powers of 10 mod 11


10^1 ? 10 mod 11
10^2 ? 1 mod 11
Pattern: 10, 1, 10, 1, ... (alternates every 2 powers)

Since 99 is odd, 10^99 ? 10 mod 11

Final Answer: (d) 10

------------------------------------------------------------

Question: Find the largest number that divides both 2^35 - 1 and 2^91 - 1.
Options: (a) 31 (b) 63 (c) 127 (d) 255
Solution:
Step 1: Use identity: gcd(a^m - 1, a^n - 1) = a^gcd(m, n) - 1
Here, a = 2, m = 35, n = 91

Step 2: Find gcd(35, 91) using Euclidean Algorithm:


91 ÷ 35 = 2 remainder 21
35 ÷ 21 = 1 remainder 14
21 ÷ 14 = 1 remainder 7
14 ÷ 7 = 2 remainder 0
So, gcd(35, 91) = 7

Step 3: Apply identity:


gcd(2^35 - 1, 2^91 - 1) = 2^7 - 1 = 128 - 1 = 127

Final Answer: (c) 127

------------------------------------------------------------

You might also like