Soru

Zorluk: OrtaProperties of Integers and Divisibility

If kk is a positive integer such that kk is divisible by 66 and k+1k + 1 is divisible by 55, what is the remainder when k2+5kk^2 + 5k is divided by 3030?

  1. A
    00
  2. B
    44
  3. 66Cevap
  4. D
    1414
  5. E
    2424

Cevap

The remainder when k2+5kk^2 + 5k is divided by 3030 is 66.
The correct answer is 66. Since kk is a multiple of 66 and leaves a remainder of 44 when divided by 55, the general form of kk modulo 3030 is 2424. Evaluating k2+5kk^2 + 5k modulo 3030 yields 242+5(24)=576+120=69624^2 + 5(24) = 576 + 120 = 696, which gives a remainder of 66 when divided by 3030.

Adım Adım Çözüm

1
Determine the congruence class of kk modulo 6 and modulo 5.
k0(mod6)k \equiv 0 \pmod 6 and k4(mod5)k \equiv 4 \pmod 5.
Given that kk is divisible by 6, its remainder modulo 6 is 0. Since k+1k + 1 is divisible by 5, k+10(mod5)k + 1 \equiv 0 \pmod 5, which implies k4(mod5)k \equiv 4 \pmod 5.
2
Find the smallest positive integer value of kk modulo 30 satisfying both conditions.
k24(mod30)k \equiv 24 \pmod{30}.
The multiples of 6 are 0, 6, 12, 18, 24, 30, ... Among these, 24 gives a remainder of 4 when divided by 5. Since 5 and 6 are coprime, k24(mod30)k \equiv 24 \pmod{30}.
3
Substitute k24(mod30)k \equiv 24 \pmod{30} into the expression k2+5kk^2 + 5k and compute the remainder modulo 30.
The remainder is 66.
k2+5k=k(k+5)24(24+5)=24(29)(mod30)k^2 + 5k = k(k+5) \equiv 24(24+5) = 24(29) \pmod{30}. Using modular arithmetic, 246(mod30)24 \equiv -6 \pmod{30} and 291(mod30)29 \equiv -1 \pmod{30}, so (6)(1)=6(mod30)(-6)(-1) = 6 \pmod{30}.

Anahtar Kavram

Chinese Remainder Theorem and Modular Arithmetic Properties
Tahmini Süre:1m 30s
Bu soruyu puanla