રેખાઓ \(\mathrm{L}_1, \mathrm{~L}_2, \ldots, \mathrm{L}_{20}\) ભિન્ન છે. \(\mathrm{n}=1,2,3, \ldots, 10\) માટે તમામ રેખાઓ \(\mathrm{L}_{2 \mathrm{n}-1}\) પરસ્પર સમાંતર છે અને તમામ રેખાઓ \(\mathrm{L}_{2 \mathrm{n}}\) એ આપેલ બિંદુ \(\mathrm{P}\) માંથી પસાર થાય છે. તો સંપૂર્ણ ગણ \(\left\{\mathrm{L}_1, \mathrm{~L}_2, \ldots, \mathrm{L}_{20}\right\}\) માંથી રેખાઓની જોડો ના છેદબિંદુુઓની મહત્તમ સંખ્યા ........... છે.

Apply the relevant identity from the chapter and substitute the values established in the previous step, keeping the original constraint in view.

Use the simplified expression to isolate the unknown, then plug the result back into the question setup to confirm the working is internally consistent.

Cross-check against a boundary or limiting case. Both the dimensional balance and the qualitative behaviour at the extreme should agree with the candidate answer.

Combine the steps above to identify the correct option. The remaining choices each fail at least one of the consistency, dimensional, or boundary checks.