Skip to content
Exercise 1.5 · Q4

Q.A boy is walking along the path y=ax2+bx+cy=ax^2+bx+c through the points (−6,8),(−2,−12)(-6,8), (-2,-12), and (3,8)(3,8). He wants to meet his friend at P(7,60)P(7,60). Will he meet his friend? (Use Gaussian elimination method.)

Tamil Nadu DgeTextbookSubjectiveImportance★★★★★
27% · 32/118 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

We substitute the three given points into y=ax2+bx+cy=ax^2+bx+c to get three linear equations in a,b,ca,b,c, solve by Gaussian elimination to find the path, and then check whether that path passes through P(7,60)P(7,60).

Step 1. Translate the three points into equations. Substituting (x,y)=(−6,8),(−2,−12),(3,8)(x,y)=(-6,8),(-2,-12),(3,8) into y=ax2+bx+cy=ax^2+bx+c:

36a−6b+c=8,4a−2b+c=−12,9a+3b+c=836a-6b+c=8,\qquad4a-2b+c=-12,\qquad9a+3b+c=8

Step 2. Write the augmented matrix.

(36−6184−21−129318)\left(\begin{array}{ccc|c}36&-6&1&8\\4&-2&1&-12\\9&3&1&8\end{array}\right)

Step 3. Eliminate aa from R1,R3R_1,R_3 using R2R_2 as the pivot row (it has the smallest coefficients). Apply R1→R1−9R2R_1\to R_1-9R_2 and R3→4R3−9R2R_3\to4R_3-9R_2:

R1−9R2=(36−36, −6−(−18), 1−9∣8−(−108))=(0,12,−8∣116)R_1-9R_2=(36-36,\ -6-(-18),\ 1-9\mid8-(-108))=(0,12,-8\mid116)

4R3−9R2=(36−36, 12−(−18), 4−9∣32−(−108))=(0,30,−5∣140)4R_3-9R_2=(36-36,\ 12-(-18),\ 4-9\mid32-(-108))=(0,30,-5\mid140)

(4−21−12012−8116030−5140)\left(\begin{array}{ccc|c}4&-2&1&-12\\0&12&-8&116\\0&30&-5&140\end{array}\right)

Step 4. Simplify the new rows. Dividing R2R_2 by 44 gives (0,3,−2∣29)(0,3,-2\mid29); dividing R3R_3 by 55 gives (0,6,−1∣28)(0,6,-1\mid28).

(4−21−1203−22906−128)\left(\begin{array}{ccc|c}4&-2&1&-12\\0&3&-2&29\\0&6&-1&28\end{array}\right)

Step 5. Eliminate bb from R3R_3 using R2R_2. Apply R3→R3−2R2R_3\to R_3-2R_2:

R3−2R2=(0, 6−6, −1−(−4)∣28−58)=(0,0,3∣−30)R_3-2R_2=(0,\ 6-6,\ -1-(-4)\mid28-58)=(0,0,3\mid-30)

(4−21−1203−229003−30)\left(\begin{array}{ccc|c}4&-2&1&-12\\0&3&-2&29\\0&0&3&-30\end{array}\right) …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.