n Choose r | Combinatorics | Mathematics Olympiad | Grade 8 -12 | IOQM 2023 | Abhay Sir | VOS

preview_player
Показать описание

➡Register For OMM Level 5 :

➡Register For OMM Level 6

➡Register For OMM Level 7

➡Register For 11th Maths & IOQM

➡Register For ISI + JEE Maths 2025 :

➡Register For Full Math Mastery 2026:

➡Register For Calculus 2024:



#IOQM #rmo2023 #ioqm2024 #RMO #inmo #mathslover #matheolympiad #olympiads #VOS #VedantuOlympiadSchool #olympiads #olympiadpreparation #isientranceexam #jeemains #isikolkata #jeemathstricks #jeemathspreparation
Рекомендации по теме
Комментарии
Автор

Solution of the HW question:
No. of paths from A(0, 0) to (2, 3) = 5!/2!3! = 10
No. of paths from (2, 3) to B(4, 5) = 4!/2!2! = 6
Total no. of ways to go to B from A = 6*10 = 60👍

*** first comment

saptakghosh
Автор

Hw. Ans.
Total no. of ways going to X from A
5C2=10
also no. of ways of going to B from X
is 4C2=6
Therefore multiplying both jobs we get 60ways

*3comment

nikhiljha
Автор

Sir HW question ans

By taking rectangle with vertics (0, 0), (0, 3), (2, 0), (2, 3)
No of possible ways to go from A to point (2, 3) are =⁵C3=10

By taking rectangle with vertics (2, 3), (4, 0), (2, 0), (4, 5)
No of possible ways to go from point (2, 3) to B are =⁴C2= 6

So clearly no of ways to go from A to B are = 10×6 = 60 Ans

srishtisaraswat
Автор

1:13:40, Le my mom- Beta Mai maths teacher ho ullu Mt bna😂😂

raunakverma
Автор

sir in the previous video I couldnt even solve a single problem but as I tried doing on my own I solved the questions of this lecture with ease !!!! becoz I didnt give up rather I enjoyed every problem with feel

AryanMishra-sz
Автор

Sir thsi means that the last question was jsut the inverse of that we do if we have an inewuality of x+y+z<900 we introduce a dummy variable. Ut here we just divided it

shalvagang
Автор

Solution of HW Question-
No. of ways of going from A to X = 5 CHOSE 3 *1= 5!/2!*3! => 10
Now, no. of ways of going from X to B = 4 CHOSE 2 *1 = 4!/2!*2! => 6
through Fundamental Principle of counting = No. of ways of going from A to B (shortest ways) = 10 * 6=

Akshat-st
Автор

In the last questionm What was original written was correct. It should be 6 instead of 10. As a, b, c, d should also be factors of 30 (2*3*5) powers of 2 in either of a, b, c, d cant be greater than 1. So the case 2 0 0 0 cant be possible.

rishabhsolanki
Автор

Sir please start algebra ... specially on functions....

Surendra.
Автор

@50:00, sir how can you say all are rectangles?,

If I take 2 and 5 from the vertical side and 3 and 6 from the horizontal side, it makes a square of side 3 units, so there a many such squares inside all the recatngles counted


Sir please solve my problem

mithusaha
Автор

Solution to HW question ways to go from a(0, 0) to x(2, 3) if you see the no of ways to go from 0, 0 to 0, 1 is exactly 1 and no of ways to go from 0, 0 to 1, 1 is exactly 2 if you can see a pattern is generated that the no of ways to go from 0, 0 to any point is the sum of the ways of going in adjacent column so ways to reach x(2, 3) is 10 and from then we start recounting then we get the same pattern so th no of ways to reach is 4, 5 is 6 so the no of ways will be 6*10 by multiplicatio. Principle


Second comment

shalvagang
Автор

Sir l solved most of the questions with ease ❤😊😊

aryanmishra