Combinatorial Arguments | Combinatorics | Maths Olympiad | Grade 8 -12 | IOQM 2023 | Abhay Sir | VOS

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

➡Register For OMM Level 7 for Grade 8 -12 Students:

➡Register For OMM Level 5 for Grade 7 & 8 Students:

➡Register For OMM Level 6 for Grade 9 & 10 Students:

➡Register For 11th Maths & IOQM for Grade 9 -11 Students :

➡Register For ISI + JEE Maths 2025 for Grade 12 & 12th Pass Students:

➡Register For Full Math Mastery 2026 for Grade 9 -11 Students :

➡Register For Calculus 2024 for Grade 9 -11 Students :



#IOQM #rmo2023 #ioqm2024 #RMO #inmo #mathslover #matheolympiad #olympiads #VOS #VedantuOlympiadSchool #olympiads #olympiadpreparation #isientranceexam #jeemains #isikolkata #jeemathstricks #jeemathspreparation
  1. Vedantu Olympiad School
  2. most important question
  3. maths olympiad
  4. rmo maths olympiad
  5. VOS
  6. maths tricks
Рекомендации по теме
Combinatorial Arguments 0:07:32

Combinatorial Arguments

How to Write 0:03:42

How to Write a Combinatorial Proof

Discrete Math II 0:11:44

Discrete Math II - 6.3.3 More Combinations and Combinatorial Proof

Combinatorial Proof Example 0:06:42

Combinatorial Proof Example (Lecture 13)

Combinatorial Proof (full 0:26:04

Combinatorial Proof (full lecture)

Combinatorial Proof : 0:03:30

Combinatorial Proof : C(2n,2) = 2*C(n,2) + n^2 | Combinatorial Proofs-3

What is Combinatorial 0:05:59

What is Combinatorial Proof ? Why C(n, r) = C(n, n-r) ? : a Combinatorial proof | Part - 1

An Introduction To 0:20:02

An Introduction To Combinatorial Proofs

Combinatorial Proofs 0:11:12

Combinatorial Proofs

Combinatorial Proof of 0:04:57

Combinatorial Proof of Binomial Theorem

Lecture 14A - 0:35:14

Lecture 14A - Combinatorial Arguments, Combinatorial Identities |Combinatorics| Discrete Mathematics

Proof: Recursive Identity 0:08:12

Proof: Recursive Identity for Binomial Coefficients | Combinatorics

Applied Combinatorics--Combinatorial Proofs 0:08:04

Applied Combinatorics--Combinatorial Proofs

Vandermonde's Identity in 0:05:14

Vandermonde's Identity in Combinatorics

Combinatorial Arguments | 0:45:01

Combinatorial Arguments | Combinatorics | Maths Olympiad | Grade 8 -12 | IOQM 2023 | Abhay Sir | VOS

Lecture 14C - 0:28:33

Lecture 14C - Combinatorial Arguments, Identities | Combinatorics | Discrete Mathematics

Pascal’s Identity by 0:14:22

Pascal’s Identity by argument || Combinatorics || Math Olympiad, ISI Entrance

Combinatorial Identities via 0:15:29

Combinatorial Identities via both Algebraic and Combinatorial Proof [Discrete Math Class]

Bijective sum! 0:00:55

Bijective sum!

Discrete Mathematical Structures, 0:47:51

Discrete Mathematical Structures, Lecture 1.6: Combinatorial proofs

Combinatorial Theory Edited 0:00:54

Combinatorial Theory Edited by Paul Erdos A Renyi and Vera T Sos #shorts

How many subsets 0:09:01

How many subsets in a set? (2 of 2: Combinatorial proof)

My favorite proof 0:13:36

My favorite proof of the n choose k formula!

Lecture 14B - 0:27:38

Lecture 14B - Combinatorial Arguments | GATE CSE 2019 Combinatorics | Discrete Mathematics

Комментарии
Автор

Sit in q 8 i have done something like thivs
Case 1
Select any 1 object of your favourite choice (it does not depend on hiw you choose) so there is 1 way
Now neglect one object from those n+1 object so now you have n object so now there you choose any (it does not matter your favourite )
So our three ball are like this
1 : favourite ball
2: neglected ball
3: any ball from rest
And so on
(Note : the neglected ball does not matter that which you choose because ultimately it is gonna be counted again in diff cases

shalvagang
Автор

In q 10. Sir we can
Also bifurcate the 4n places into 3n and n places where we take any 2 pepole for 3n places and 3 people for n places
And arrange them. So it is clear for every unique arrangment of them would correspond to their (4n)! Arrangements

shalvagang
Автор

My SOLUTION FOR HW QUESTION


It is a way to achieve the no of groups of 3 subsets of n people(some subsets can be zero)
Let there be n people

The first sigma selects i people into 1st groups while the second sigma deals with the remaining people for group 2 the remaining (n-i-j) automatically allot people into group 3 .

In the RHS it simply states that every person is given three options to join group 1 2 or 3 hence 3^n

chinmayashankar
Автор

Most beautiful video of maths that I have ever seen. 😍😍😍🙏🙏🙏

C__YashKumar
Автор

Sir pe algebra pe startegy session before u start algebra please.

Surendra.
Автор

I got immense joy in solving these problems this is my first joy moment after getting 0 in ioqm 😂😂

nikhiljha