Which one of the following numbers is exactly divisible by (11¹³ + 1)?
- A11³⁹ - 1
- B11³³ + 1
- C11²⁶ +1
- D11⁵² - 1
Solution & Step-by-step Explanation
The problem asks us to identify which number among the options is exactly divisible by the expression . First, let's calculate the value of the divisor.
We calculate :
Therefore, the divisor is:
Our task is to find which of the given options is exactly divisible by .
Number Divisibility Rules with Exponents
We can determine divisibility using properties of exponents and modular arithmetic. A useful technique is to analyze the expression modulo the divisor. The property is particularly helpful.
Let and . Our divisor is . We will check each option by finding its remainder when divided by . This is equivalent to evaluating the expression modulo , using the fact that .
Analyzing Each Option
**Option 1: Check Divisibility of **
Let the expression be . We want to find the remainder of when divided by . Let . The expression becomes . We can rewrite the exponent as . So, . Now, we use the modular property :
Now substitute this back into the expression :
Since the remainder is (not ), is not exactly divisible by .
**Option 2: Check Divisibility of **
Let the expression be . We want to find the remainder of when divided by . Let . The expression becomes . We can rewrite the exponent as . So, . Using the property :
Now substitute this back into the expression :
Since the remainder is , is exactly divisible by .
**Option 3: Check Divisibility of **
Let the expression be . We want to find the remainder of when divided by . Let . The expression becomes . We can rewrite the exponent in terms of : . So, . Using the property :
Now substitute this back into the expression :
Substitute :
Since the remainder is (not ), is not exactly divisible by .
**Option 4: Check Divisibility of **
Let the expression be . We want to find the remainder of when divided by . Let . The expression becomes . We can rewrite the exponent in terms of : . So, . Using the property :
Now substitute this back into the expression :
Substitute :
Since the remainder is (not ), is not exactly divisible by .
Conclusion Summary
By applying modular arithmetic and exponent properties, we found that only yields a remainder of when divided by . Therefore, is the number that is exactly divisible by .