We are given:
We aim to compute the total number of distinct intersection points.
If all 37 lines intersect pairwise without concurrency:
\[ \text{Total Intersections} = \binom{37}{2} = \frac{37 \cdot 36}{2} = 666 \]
\[ \binom{13}{2} = \frac{13 \cdot 12}{2} = 78 \] But since all 13 lines intersect at point A, they produce only 1 intersection.
So, we subtract:
\[ 78 - 1 = 77 \]
\[ \binom{11}{2} = \frac{11 \cdot 10}{2} = 55 \] But all 11 lines intersect at point B, producing only 1 intersection.
So, we subtract:
\[ 55 - 1 = 54 \]
\[ \text{Valid Intersections} = 666 - 77 - 54 = \boxed{535} \]
\[ \boxed{535 \text{ distinct points of intersection}} \]
| List-I | List-II | ||
|---|---|---|---|
| (A) | $f(x) = \frac{|x+2|}{x+2} , x \ne -2 $ | (I) | $[\frac{1}{3} , 1 ]$ |
| (B) | $(x)=|[x]|,x \in [R$ | (II) | Z |
| (C) | $h(x) = |x - [x]| , x \in [R$ | (III) | W |
| (D) | $f(x) = \frac{1}{2 - \sin 3x} , x \in [R$ | (IV) | [0, 1) |
| (V) | { -1, 1} | ||
| List I | List II | ||
|---|---|---|---|
| (A) | $\lambda=8, \mu \neq 15$ | 1. | Infinitely many solutions |
| (B) | $\lambda \neq 8, \mu \in R$ | 2. | No solution |
| (C) | $\lambda=8, \mu=15$ | 3. | Unique solution |