To solve the problem, we need to find the number of positive integers (n < 1000) that satisfy both conditions:
Step 1: Translate the conditions into congruences
-
Condition 1: (2n + 1 \equiv 0 \mod 5)
(2n \equiv -1 \equiv 4 \mod 5)
Multiply both sides by the inverse of 2 mod 5 (which is 3):
(n \equiv 4 \times 3 \equiv 12 \equiv 2 \mod 5). -
Condition 2: (3n + 1 \equiv 0 \mod 7)
(3n \equiv -1 \equiv 6 \mod 7)
Multiply both sides by the inverse of 3 mod 7 (which is 5):
(n \equiv 6 \times 5 \equiv 30 \equiv 2 \mod 7).
Step 2: Apply the Chinese Remainder Theorem
Since (5) and (7) are coprime, the system of congruences:
(n \equiv 2 \mod 5) and (n \equiv 2 \mod 7)
has a solution (n \equiv 2 \mod 35) (LCM of 5 and 7 is 35).
Step 3: Count valid (n < 1000)
(n = 35k + 2) where (k \geq 0) and (35k + 2 < 1000):
(35k < 998 \implies k < \frac{998}{35} \approx 28.51).
Thus, (k) ranges from 0 to 28 (inclusive), giving (\boxed{29}) terms.
Answer: (\boxed{29})

作者声明:本文包含人工智能生成内容。