help-42

[tame quail]

Does that make sense?

[opaque plume]

Yeah, i think representation of dot product as matrix multiplication is the right way

It should work, thanks a lot!

@tame quail thanks mate a lot

.close

[calm coral]

Channel closed

Closed by @opaque plume

Use .reopen if this was a mistake.

[calm coral]

Available help channel!

Send your question here to claim the channel.

Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!

Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.

[median cloak]

At

[median cloak]

At

Ay

Ay

Ay

.close

[calm coral]

Channel closed

Closed by @median cloak

Use .reopen if this was a mistake.

[cedar carbon]

are you good sir

[median cloak]

.reopen

[calm coral]

✅

[median cloak]

I’m divine, thank you

[regal orbit]

waste of unoccipied channels

[cedar carbon]

Well then, what is your doubt?

[median cloak]

I feel guilty for our planet

[cedar carbon]

Don't.

[median cloak]

Why the frequencies of connected ropes are the same.

[cedar carbon]

Dawg i am so close to calling mods

You open a channel spam random nonsense and now spew random nonsense

All of this is against the rules

[median cloak]

No, I was uncertain if I should ask the question

[regal orbit]

Chat, get him banned

[median cloak]

Because I think it is provable using some formula

[cedar carbon]

Oh

Can you post the entire doubt

[median cloak]

Then I decided to post the question because I have a impression that the process of proving it would be a little complicated

[cedar carbon]

With all the details

[cedar carbon]

That's how it usually goes

[median cloak]

There’s a claim that if ropes are connected

Then their frequencies would be the same

Also the tensions would be the same

[rigid mist]

Is there uh

A more generalized form by chance

[median cloak]

We can simplify the question by limiting the numbers of ropes into 2

[rigid mist]

But aren’t ropes made up of ropes

[median cloak]

Different ropes made by different materials

Heavy rope, light rope

[rigid mist]

Okay so

I construct one rope out of steel wire and one out of string and apply equal pulling force to both, surely they must have different tensions

[median cloak]

Sure, but according to the claim their tensions should be the same

[median cloak]

But why

[rigid mist]

Where the claim though

[median cloak]

^

[rigid mist]

Is that the only claim

[median cloak]

Yes, I have been told to memorize it

[verbal finch]

because it is just the force
balance forces

u pull with some F say

then assuming the rope is taut and does not move

in equilibrium forces are equal

forces are tension and F

so T = F

[median cloak]

Yes, each points of the rope should be in the state of force equilibrium

[median cloak]

What if the rope isn’t taut

[verbal finch]

that would change things

[median cloak]

I see

[verbal finch]

yep

[median cloak]

What about the frequency?

[verbal finch]

what do u mean frequency?

[median cloak]

If we impose some wave on the connected rope

[verbal finch]

hm?

[median cloak]

Will the frequency in each rope segment be the same

[verbal finch]

yes

frequency is source dependent and not medium dependent

as long a u are using the same source to send the waves

frequency does not change

the velocity of wave changes and wavelength adjusts itself such that frequency remains constant

[median cloak]

I think that’s a counter example?

[verbal finch]

that is completely different?

[median cloak]

A connected ropes consist of steel bar and thread

[verbal finch]

sending individual waves through individual medium is different

[verbal finch]

mhm

[median cloak]

A connected ropes could be consist of ropes with different medium (or material)

[verbal finch]

yes

the wavelength changes accordingly

[median cloak]

A rope that is made by different ropes connected altogether

[verbal finch]

mhm

frequency changes

as u are not using the same same source

and velocity of wave is changing every segment

like say u have 2 wires attached

u send a wave from sourceto wire 1

[median cloak]

The same source, you mean the source of wave

[verbal finch]

now for wire 2, the source should be wave from wire 1 but not the actual source u used to produce the wave

[verbal finch]

yes

[median cloak]

That’s different from what has written on my textbook

[verbal finch]

what is it written?

can u send a pic?

[median cloak]

If connected, then the tension and frequency of each string should be the same

[median cloak]

It is written in Chinese

[verbal finch]

ohh

[verbal finch]

did they mention the 2 strings are made of 2 diff materials?

[median cloak]

More accurately, a rope is made by material A, and another is made by material B

[verbal finch]

hmm

[median cloak]

And we connect these ropes into one

The tensions and frequency, if a wave is imposed upon, should be the same

That’s the claim by the book writer

[verbal finch]

hmm lemme c

[median cloak]

<@&286206848099549185>

[calm coral]

@median cloak Has your question been resolved?

[calm coral]

@median cloak Has your question been resolved?

[calm coral]

@median cloak Has your question been resolved?

[calm coral]

Channel closed

Closed due to timeout

Use .reopen if this was a mistake.

Available help channel!

Send your question here to claim the channel.

Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!

Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.

[brazen elbow]

but im not sure how to find the distance between C and the intersection circle

i stillll dont know how to work this out

[quiet whale]

When you subtract those two equations and simplify, you'll get z = 0.
So the equation of the intersection circle can be found by setting z = 0 in any of the two equations, and it lies in the xy-plane.
Now imagine if point C were to lie on the xy-plane. Finding the minimum distance is easy, because the point on the circle where the minimum distance happens has to lie on the same straight line connecting the center and the point C.
Although C doesn't lie on the xy-plane, its projection on that plane does. And the minimum distance of the projection happens at the same point as the minimum distance of point C itself, because of Pythagoras.

[brazen elbow]

oh fuck thats really nice

i didnt notice the circle actually belonged on the xy plane

[brazen elbow]

thats crystal clear now, thanks for the help!

.close

[calm coral]

Channel closed

Closed by @brazen elbow

Use .reopen if this was a mistake.

[brazen elbow]

this gets me 7.99

[calm coral]

Available help channel!

Send your question here to claim the channel.

Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!

Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.

[solemn notch]

\

[solemn notch]

how did he know the values of x and y

he dont know y so cant find x and dont know x in the other one so cant find y

x + (0.6667) y = 1

[main musk]

yes this isn't a definitive answer

its just a possibility

but i suppose there could be many more solutions

[coral dagger]

they are parallel lines

[main musk]

he refers to conditions though so he might for example base this on both of them being intgers?

[coral dagger]

same line

divide first line by 2 to get the second

[solemn notch]

oh so this will already be given if a question like this came in exam

[clear delta]

for "most" sets of equations like this, it's possible to find a solution if you have as many equations as you have variables; this is called "solving simultaneous equations" and there are a number of techniques, including graphing, substitution, and elimination.

in this case, the second equation gives you no additional information, so there are many solutions.

[vivid vine]

what does it say?

i cant read that

[solemn notch]

is ill conditioned or not

this is ill and well conditioned systems

.close

[calm coral]

Channel closed

Closed by @solemn notch

Use .reopen if this was a mistake.

[calm coral]

Available help channel!

Send your question here to claim the channel.

Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!

Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.

[visual dust]

what does it mean to "verify" the system for the triangle?

[echo flax]

do u study IB?

[echo flax]

u need to apply ur formula to answer this quetion

[visual dust]

the law of cosines formula?

[visual dust]

no

[calm coral]

@visual dust Has your question been resolved?

[visual dust]

<@&286206848099549185>

[lofty sage]

You need help?

[visual dust]

yes
i don't understand what the question means by verifying the system for the triangle?

[lofty sage]

prove it

prove the system

like

yknow

prove the system works

[visual dust]

so i should just solve for any one of the cosines (knowing that the solution will give the law of cosines)?

[lofty sage]

yeah

just

prove the system works

[visual dust]

alright i see

thank you!

[lofty sage]

yw

[visual dust]

.close

[calm coral]

Channel closed

Closed by @visual dust

Use .reopen if this was a mistake.

[lofty sage]

.reopen

.close

.reopen

im alone now

[calm coral]

Available help channel!

Send your question here to claim the channel.

Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!

Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.

[storm spire]

what is this meaning

[tardy mauve]

3 5 7 3 5 7 3 5 7

period = 3

[calm coral]

@storm spire Has your question been resolved?

[calm coral]

Channel closed

Closed due to timeout

Use .reopen if this was a mistake.

Available help channel!

Send your question here to claim the channel.

Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!

Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.

Channel closed

Channel closed due to the original message being deleted.
If you did not intend to do this, please open a new help channel,
as this action is irreversible, and this channel may abruptly lock.

[rapid beacon]

.close

[calm coral]

Available help channel!

Send your question here to claim the channel.

Remember:
• Ask your math question in a clear, concise manner.
• Show your work, and if possible, explain where you are stuck.
• After 15 minutes, feel free to ping <@&286206848099549185>.
• Type the command .close to free the channel when you're done.
• Be polite and have a nice day!

Read #❓how-to-get-help for further information on how to ask a good question, and about conduct in the question channels.

[golden dragon]

anyone can help me guide throught this

[golden dragon]

the statement " 10 in at least two of three courses " confuses me

[patent tundra]

So 10 students are enrolled in two courses or three courses

[golden dragon]

yep

actually i got the formula

but

when i tried to solve it

something feels wrong

[golden dragon]

three courses

two of the three courses

what that means actually

[patent tundra]

Do you know what a course is?

[golden dragon]

math statistic networking

90 = 75 - |A ∩ B| - |A ∩ C| - |B ∩ C| + 2

this is what i got

i got problem with intersection

"|A ∩ B| - |A ∩ C| - |B ∩ C|"

[patent tundra]

For the first question?

[golden dragon]

i cant solve question 1 2 3 if i cant fill up the venn diagram

since it ask 10 in at least two of the three courses

[patent tundra]

yes that looks good

[golden dragon]

whats next

[patent tundra]

You can put the 8 students anywhere

[golden dragon]

wait what

all this time is was 8

[patent tundra]

So just put them in the intersection of math and networking

[golden dragon]

so i can put that 8 randomly

[patent tundra]

10-2=8

[patent tundra]

yep

[golden dragon]

so once i got 8

which part do you think i should solve

[remote gorge]

what do you need help with?

[patent tundra]

So start by finding number students studying only math, only networking etc

[golden dragon]

sets ,

i was here for 3 hours actually

[remote gorge]

damn ok

[remote gorge]

how many people are there total?

[golden dragon]

90

[remote gorge]

alr

[hushed badge]

it says that 10 students are in at least 2 courses so they can be in N and S or N and M or S and M or N and M and S

[golden dragon]

so it means i can put 8 randomly between either one of the intersections

[hushed badge]

N i S U N i M U S i M U N i M i S

find this

[golden dragon]

eh the words kinda confuse me a lil

[hushed badge]

i means Intersection

N -> Networking
M -> maths
S -> Statistics

[golden dragon]

n i m i s

is 2

[hushed badge]

yes

just form equations and solve them

[golden dragon]

how tho

[hushed badge]

try solving i

i)

N U M U S U (N i S) U (N i M) U (S i M) U (N i M i S)

find this

and do let me know if the ans is correct or not

[golden dragon]

n u m u s is 90

[hushed badge]

yes

[golden dragon]

n i m i s is 2

left over is (N i S) U (N i M) U (S i M)

should i put 10 in nis nim sim

[hushed badge]

(N U M U S) U ((N i S) U (N i M) U (S i M) U (N i M i S))

the right expression is equals to 10

[golden dragon]

ok this seems hard but ill try

[hushed badge]

90 + 10 = 100

here you go

[golden dragon]

eh

how is that

[hushed badge]

first expression is 90

and the second expression is 10

it is given in the question it self

[golden dragon]

wait total student is 90

which is n u m u s

[hushed badge]

that 10 students are in at least two courses i.e. they can be in three also

oops sorry

[golden dragon]

hehe its okay

[hushed badge]

you have to find the value

[golden dragon]

do you feel this question is hard

[hushed badge]

umm I have solved these types of questions

they are not that hard but a little bit lengthy

[golden dragon]

im new to this topic so yeah kinda painful for me to understand it

cuz usually they would give some hint like prob 7 guys who take stat and networking

for example

but this is like no hint for intersection

[hushed badge]

umm let me try

could you wait

[golden dragon]

sure

😄

[hushed badge]

wait 10 min

I will send you my soln

[golden dragon]

okie

[hushed badge]

I have to relearn this

actually I have forgot how to do these type of problems

pardon my grammar

[golden dragon]

its okay

[golden dragon]

inclusion exclusion

is that the formula for that?

[hushed badge]

umm its a concept

[golden dragon]

oh

[hushed badge]

its not a formula

just wait for 10 min

btw do you have answers

I am solving the question

[golden dragon]

the question does not have answers

its in the form of pdf

[hushed badge]

so you dont have the answers for this question

[golden dragon]

yep

i only can get answers

once my class starts

which is next week

[hushed badge]

I think the first part is just asking you to do the union

n(N U M US)

[golden dragon]

union?

[hushed badge]

yes

you just have to take the union of N,M,S

[golden dragon]

so the answer is 40

[hushed badge]

how did you come up with that

[golden dragon]

oh wait

add 3 of this

the 3 ticks

right?

[hushed badge]

N(A U B U C) = N(A) + N(B) + N(C) - N(A i B) - N(A i C) - N(B i C) + N(A i B i C)

do this

this is the formula for A U B U C

[golden dragon]

what is N

[hushed badge]

no of elements

no of elements in that set

[golden dragon]

is there a number for N

[hushed badge]

N(Networking) = 40

N(Math) = 15

[golden dragon]

ohhh

[hushed badge]

N(Statistics) = 20

[golden dragon]

90 = 75 - N(A i B) - N(A i C) - N(B i C) + 2

[hushed badge]

yes

[golden dragon]

N(A i B) - N(A i C) - N(B i C) how we solve this

[hushed badge]

for that we are given another condition

10 stundets at least in two courses

[golden dragon]

so how do we put that condition into N(A i B) - N(A i C) - N(B i C)

[hushed badge]

ok

so basically we are given this

N(A i B) + N(B i C) + N(A i C) -2N(A i B i C) = 10

[golden dragon]

2N(A i B i C) what is this actually

[hushed badge]

basically question says that 10 students are in at least two of the three courses

so I have considered A i B

A i C

B i C

and add all of them

but if you would add all of them you would see that

A i B i C is added 3 times

so we have to subtract it 2 times

soryy there should be i instead of U

typo error

[golden dragon]

this is very complex

[hushed badge]

see

they have told you

that 10 students are in at least two courses

[golden dragon]

wait lemme draw

[hushed badge]

means they can be in A and B or B and C or A and C

[golden dragon]

ok nvm

so they said 10 in either one

[hushed badge]

or A and B and C

[hushed badge]

10 have opted for at least two courses

so have to consider all the cases

means they can opt for 3 courses also

[golden dragon]

either one

[hushed badge]

let me send you a pic

denoting it

wait 2 min

well the ans is

59 for first part

let me send you the pic for those 10 students

are you there /

?

[golden dragon]

yep

[hushed badge]

dont you think that these are the those students that have opted for at least two courses

[golden dragon]

yes

either one

[hushed badge]

the shaded part represents those 10 students

[golden dragon]

everything?

[hushed badge]

yes

means they can be anywhere

[golden dragon]

but the thing is we need a prove that 10 is in the shaded area

[hushed badge]

no we dont have to

it is given in the question

that they have opted for at least two courses

[golden dragon]

so we dont need to find instead we need to solve it

for the other question

[hushed badge]

ok lets start with basics

if a set is given to you

lets say the set of months

it is represented by M

and on venn diagram it is represented by a circle

now if I ask you how many months are there

what would you say?

[golden dragon]

12

[hushed badge]

yes

it means n(M) = 12

no of elements in M = 12

[golden dragon]

so compare to the venn diagram you just did the shaded

shaded = 10

[hushed badge]

yes

just like in this case 12 represents a circle named M completely shaded

[golden dragon]

and possibility the number could be everywhere which could be added to 10

[hushed badge]

yes exactly

[golden dragon]

bruh so theres no point to find the solution inside the shaded area

because "possibility"

[hushed badge]

yes

but now listen

if you have a set A and a set B

what does the union represents

can you tell me

lets say n(A) = 10

and n(B) = 20

[golden dragon]

hmm i cant tell obviously

[hushed badge]

now tell me what would be the n(A U B)

no no you can tell

[golden dragon]

a u b = 10 , 20

a u b = {10 , 20}

correct?

[hushed badge]

I have asked n(A U B) not A U B understand the difference

I have given you the total elements not the particular element

[golden dragon]

wait lemme think

[hushed badge]

n(A) = 10

n(B) = 20

means A contains 10 items and B contains 20 items

now think

n(A U B) ?

[golden dragon]

A = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}

[hushed badge]

you are confusing 10 with the elements

[golden dragon]

really?

[hushed badge]

I have not specified you what kind of elements are in A

imagine it like

A is a set( it can be anything )

it can be anything

like a set of your favourite chocolate brands

like a set of months

[golden dragon]

so go back to question you given

you me answer this first

n(A) = 10

[hushed badge]

it basically means there is a set A and it contains 10 elements

[golden dragon]

10 type of chocolate brans

[hushed badge]

yes it could be anything

[golden dragon]

ooh

[hushed badge]

now similarly n(B) = 20

[golden dragon]

20 types of chocolate brands

[hushed badge]

union means we are considering every element in A and every element in B

so lets say if A = {1, 2, 3}

[golden dragon]

some elemant in A have in elementin b

[hushed badge]

no A U B is a operation not a set

[golden dragon]

ohhhh

[hushed badge]

lest say A = {1,2,3}

B = {2,3,4}

now tell me A U B

[golden dragon]

a u b = 1 2 3 4

a n b = 2 , 3

[hushed badge]

yes exactly

[golden dragon]

correct?

[hushed badge]

yes

[golden dragon]

yay

[hushed badge]

now I ask you n(A U B)

what do you think

n( ) represents the size

[golden dragon]

30?

[hushed badge]

for which one

[golden dragon]

a u b

[hushed badge]

you are giving the answer of the previous question ??

[golden dragon]

oh no i must be confuse

[golden dragon]

lemme think

[hushed badge]

a u b = 1,2,3,4

yes ??

[golden dragon]

yes

[hushed badge]

now you tell me the size of this

basically how many items it have

[golden dragon]

4

[hushed badge]

yes exactly

[golden dragon]

4 type of choco bran

[hushed badge]

yes

n() tells the size

if I say A = {1,2,3,4,5,6,7,8,9}

[golden dragon]

now i know the purpose of n

[hushed badge]

then n(a) is 9

[golden dragon]

its like in coding

right

[hushed badge]

yes like function

[golden dragon]

oh my god

ok i got it now

[hushed badge]

yes

now back to the original question

no of students who opted networking are 40

yes ??

[golden dragon]

yes

[hushed badge]

no networking

it was networking my bad

[golden dragon]

s = 40

[hushed badge]

resend the question once again

[golden dragon]

okay

[hushed badge]

so that we dont have to scroll

[hushed badge]

now no of students that are enrolled in networking = 40

right ??

[golden dragon]

yes

20 in statistics

15 in math

[hushed badge]

so we can say that n(N) = 40

[golden dragon]

nsize of (N) = 40

[hushed badge]

yes but write it like n()

[golden dragon]

got it

[hushed badge]

n tells the size

and n(M) = 15

n(S) = 20

understood ?

any doubt

[golden dragon]

yes sir

no doubt

[hushed badge]

okay

lets proceed further

now it is given that 10 students are at least in two courses

so it is a little tricky statement

[golden dragon]

the flower you shaded

[hushed badge]

lets say understand it from basics

tell me what do you understand from the word 'at least'

here

[golden dragon]

smallest amount?

[hushed badge]

no

it means that those 10 students have participated in 2 or more courses

because it is written at least 2

yes the minimum but you have to consider greater than 2 also

[golden dragon]

got it

max is 3

[hushed badge]

yes

if the max was 5

then will consider 2,3,4,5

[golden dragon]

got it

[hushed badge]

because all them are greater than 2

2 <=

this

[golden dragon]

mistake

[hushed badge]

its ok

now see the shaded part

[golden dragon]

lemme copy

pic

[hushed badge]

yes

[golden dragon]

the flower

[hushed badge]

now see

[golden dragon]

n(flower) = 10

[hushed badge]

yes

correct

now the question is how do I form a equation

because we know that n(n) + n(m) + n(s) = 75

[golden dragon]

yep

[hushed badge]

now how do I write this 10 in this form

so you can see

if I write this

[golden dragon]

slide 10 between equation

[hushed badge]

no no

just see

what I am wrting

if i do
n(n i s) + n(m i s) + n(n i m)

what would I get

if I shade this

sorry i instead of u

[golden dragon]

n(n i s.) + n(m i s) + n(n i m)

[hushed badge]

dont you think

if I shade this then I am considering this ( n i m i s ) part three times

think for a moment

[golden dragon]

a = { 1 2 3 }
b = { 2 3 4 } just like this rule

??

[hushed badge]

draw a fresh venn diagram

[golden dragon]

got it

[hushed badge]

and try to shade this part
n(n i s) + n(m i s) + n(n i m)

and send me the pic

[hushed badge]

ok shade the part

just shade n i s first

[golden dragon]

does it include the middle

[hushed badge]

just send me

I will tell you after looking the pic

[hushed badge]

yes correct

now what does it mean

[golden dragon]

n i m i s = shade 3 times

[hushed badge]

it means that the students that lie in this part have taken n and s both the courses

right??

[golden dragon]

yes

[hushed badge]

now try to shade n i m

in this diagram only

without erasing anything

and send the pic

[hushed badge]

from different color

I want to see

then I will tell you

[golden dragon]

ok

[hushed badge]

yes good

and for m i s

you can do by yourself

no need to send the pic

[golden dragon]

okay

[hushed badge]

now as you can see that it is resulting

in taking this area n i m i s three times

[golden dragon]

3 color = 3 times

[hushed badge]

yes

now back to the question

question says that 10 students have opted for at least 2 courses

means they might have opted for n and s

which you will represent with n i s

[golden dragon]

n and s or n and m or m and s right

[hushed badge]

yes but you forgot one thing

n i s i m

we are talking about at least 2 courses

[golden dragon]

ahhh

[hushed badge]

means they can also take 3 courses too

[golden dragon]

we considered this as assumption

[hushed badge]

no it is not assumption

at least 2 means

2 <=

remeber

[golden dragon]

got it

[hushed badge]

sorry wrong sign lmao

[golden dragon]

2 <=

[hushed badge]

yes

now see my shaded part

we have to consider every part 1 time

otherwise we might end picking dublicate persons

[golden dragon]

got it

different family

[hushed badge]

now if you see the shaded part

you can see that every person in that region has taken at least two courses

[golden dragon]

yep

[hushed badge]

now the question how to find this shaded part

we can do

[golden dragon]

10 / 3

[hushed badge]

no no

think like this

[golden dragon]

sorry

[hushed badge]

dont be sorry

n i m + m i s + n i s

if I consider this part

this covers the shaded part

but you can see the problem

[golden dragon]

n i m + m i s + n i s = 10

[hushed badge]

it is considering the n i m i s three times

so we have to subtract it 2 times so that we consider it only 1 time

[golden dragon]

so i imagine the n i m i s like a layer of cake

[hushed badge]

yes

it is overlapping

everytime

[golden dragon]

got

[hushed badge]

n i s + n i m + m i s - 2(n i m i s) = 10

now you know why here is a -2

[golden dragon]

to remove overlapping

[hushed badge]

yes exactly

if we subtract it 3 times then we will remove that part

but we have to consider it 1 time

imagine it in your mind

[golden dragon]

lets say 3 petal overlap each other

and you want remove the middle 2 times

[hushed badge]

yes

exactly

you got it

[golden dragon]

yessir

[hushed badge]

now you know how I came up with this

[golden dragon]

yep so you want it to be balance the middle among the ends

petal

[hushed badge]

yes otherwise you consider some students more than one time

[golden dragon]

got it

[hushed badge]

easy method for doing this

is just shade the region

and think how can I get this region

which I did

first I shaded the region of 10 and then made an equation with that

[golden dragon]

10 - 2 10 - 2 10 -2

so imagine 10-2 is a petal

and you want remove the middle

ok wait lemme

[hushed badge]

now you have the equation

you can solve the i) part

n(n) + n(m) + n(s) = 75

n(n i m) + n(n i s) + n(m i s) -2(n i m i s) = 10

now you are required to find students who have opted for at least one class

[golden dragon]

lemme try

[hushed badge]

basically try to shade this region and send me the pic

[golden dragon]

using this ?

: n(n i m) + n(n i s) + n(m i s) -2(n i m i s) = 10

[hushed badge]

no just shade the region on venn diag

[golden dragon]

okay

[hushed badge]

all the students who have opted for at least one course

and send me the pic

[golden dragon]

shade for this right

[hushed badge]

yes

dont worry

just shade that region which you might think

and send me the pic

[hushed badge]

umm

it is written that at least one course

[golden dragon]

one <=

[hushed badge]

so you have to consider all the region

[golden dragon]

ok

[hushed badge]

yes

[hushed badge]

means the region where students are taking at least one course

yes but dont you think you forgot

s and m

[golden dragon]

ooohh

[hushed badge]

now shade them also

[hushed badge]

yes but you made a mistake

you overlapped the regions

[golden dragon]

the flower

overlapped

[hushed badge]

remeber I told you that you dont have to overlap

[golden dragon]

got it

its correct but i overlapped the region

[hushed badge]

yes

there are 7 sections in this diag

and you have to shade each one of them only one time

because these are the students that are taking at least one course

[golden dragon]

7 sections for 7 times?

okay

[hushed badge]

now you know that this shaded part is nothing but

n u m u s

dont you think

[golden dragon]

wait this also wrong right

[hushed badge]

yes this is correct

[golden dragon]

ow

[hushed badge]

good

this is exactly n u m u s

[golden dragon]

oooo

[hushed badge]

means you taking all the n, m and s elements one time only

[golden dragon]

so question 1 is the red part

[hushed badge]

i) is n u m u s

this region which you have just shaded is the first part asking

[golden dragon]

the green the blue and the red?

[hushed badge]

yes

all of them combined

now how to find this part

[golden dragon]

so we say we take part of the red add with part of green and add part of blue

[hushed badge]

yes but there is a direct formula for this

[golden dragon]

to find red we can substract the petal

15 - 10 is 5

so red part is 5

yes?

[hushed badge]

no it is not like that

[golden dragon]

oh so we do formula

[hushed badge]

yes there is a formula of a u b u c

a u b u c = n(a) + n(b) + n(c) - n(a i b) - n(b i c) - n(a i c) + n( a i b i c)

[golden dragon]

inclusion exclusion formula

[hushed badge]

now you know what is n(a) + n(b) + n(c)

= 75 right?

[golden dragon]

yep

a i b i c 2

[hushed badge]

yes

[golden dragon]

90 = 75 - n(a i b) - n(b i c) - n(a i c) + 2

[hushed badge]

yes correct

now how to find this part

you can use this equation

let me tag it

[hushed badge]

this one

this is exactly the part you need

[golden dragon]

so we gonna bring 75 and 2 the left side?

[hushed badge]

yes

no no

wait

[hushed badge]

in this equation

put n(a) + n(b) + n(c) = 75

now

a u b u c = 75 - [n(a i b) + n(b i c) + n(a i c)] + 2

correct

?

[golden dragon]

yes

so we not gonna include the 90 right

[hushed badge]

no we dont have to include 90

[golden dragon]

got it

[hushed badge]

a u b u c is not equal to n(a) + n(b) + n(c)

question is asking a u b u c

[golden dragon]

just realise

[hushed badge]

you just solve this'

[hushed badge]

this

[golden dragon]

so we got 73

[hushed badge]

no

it is +2

[golden dragon]

ahh my bad cuz i thought i can use 75 substract 2

[hushed badge]

a u b u c = 77 - [n(a i b) + n(b i c) + n(a i c)]

correct ?

[golden dragon]

yep

[hushed badge]

now to find the bracket term

use this

n(n i m) + n(n i s) + n(m i s) -2(n i m i s) = 10

put n i m i s = 2

[golden dragon]

we move 77 to left hand side

[hushed badge]

n (n i m) + n(n i s) + n(m i s) -2(2) = 10

correct ?

[golden dragon]

yep

[hushed badge]

now take this on right side

n (n i m) + n(n i s) + n(m i s) = 14

correct /

?

[golden dragon]

yep

[hushed badge]

now use this in this

a u b u c = 77 - [n(a i b) + n(b i c) + n(a i c)]

[golden dragon]

77 - 14

[hushed badge]

yep

[golden dragon]

63

[hushed badge]

yes

this is the ans

[golden dragon]

how th question 1 can be complicate

[hushed badge]

wait 2 min

[golden dragon]

totally cooked for discrete math

[hushed badge]

I am coming in just a moment

[golden dragon]

oka

[hushed badge]

yes

[hushed badge]

ok

actually this is pretty basic stuff

you can actually watch a playlist on yt

[golden dragon]

can you give me

[hushed badge]

you will solve every question

[golden dragon]

actually i dont wanna listen my lecturer cuz he really confuse me tbh

not only me everyone

[hushed badge]

same thing with everyone

ok do you also want some book for practice questions

[golden dragon]

sure

[hushed badge]

I will give you a book you just have to solve only examples from that book

that would be sufficient

[golden dragon]

can we solve 2 and 3

[hushed badge]

in fact more than sufficient

[golden dragon]

for 2 i would say 90 - 75

aso i would like a book

to practice

[hushed badge]

you have to take the complement of this answer

[golden dragon]

for question 2 ?

or question 1

[hushed badge]

question 2

basically it is the complement of first answer

[golden dragon]

90 - 63

[hushed badge]

yes

[golden dragon]

dang but why tho

[hushed badge]

sorry I read the question wrong

90 - 75 is correct

[golden dragon]

yay

so number 3 lemme sketch

[hushed badge]

are you solving some kind of assignment

[golden dragon]

its a quiz but he assign it too fast

we just move on to the second chapter this week which is sets

[hushed badge]

bro just don't cuss me If the answer doesn't match

lmao

[golden dragon]

so i'm still kind blank

nah its ok

i learn alot tbh

[hushed badge]

I am also a student like you

[golden dragon]

better explaination than lecturer tbh

really?

[hushed badge]

but I haven't read discrete mathematica

[golden dragon]

im just a freshman at cs

[hushed badge]

me too but I am in se

[golden dragon]

woahh

[hushed badge]

software engineering

[golden dragon]

looks hard

have calculus

right

[hushed badge]

I am in 2nd year

I learned calc2 and calc3 but now I forgot it

who remembers that shit

[golden dragon]

is it gonna help

in programming

[hushed badge]

nope

nothing

[golden dragon]

:/

i got lied to

my lecturer told me calculus is super important

[hushed badge]

in fact discrete mathematics would also not help

[golden dragon]

huh

even truth tables?

and type of shi

[hushed badge]

yes

[golden dragon]

💀

then what helps

[hushed badge]

its a waste of time

[golden dragon]

tbh i dont understand math till i met coding

[hushed badge]

basically it wil help if you want to go in research

[golden dragon]

way much better bruh

actually in my degree for overall 3 years of study

i dont have calculus

[hushed badge]

ohh

which uni ?

[golden dragon]

unless im doing transfer to other program

like american transfer degree

mine is sunway university

[hushed badge]

where is it?

[golden dragon]

malaysia

well known private university

[hushed badge]

oohh you are from malaysia

[golden dragon]

not literally from malaysia

im from vietnam origin

[hushed badge]

ok nice

[golden dragon]

hbu

[hushed badge]

I am from india

[golden dragon]

woah

also study in india?

[hushed badge]

yes yes

[golden dragon]

sheesh

[hushed badge]

I failed jee advanced but cleared jee mains

[golden dragon]

what happen if you dont pass advanced

[hushed badge]

basically its an entrance exam to get engg uni in india

have you ever head of IIT

[golden dragon]

nope

but when i heard entrance exam its super hard eh

[hushed badge]

yes its super hard

let me show you a question from that exam

[golden dragon]

sure

[hushed badge]

a maths ques

[golden dragon]

i would probably cry

[hushed badge]

no no

this is physics section

[golden dragon]

my brain shrink

you took this for entrance exam?

[hushed badge]

yes

but failed

I cleared jee mains with 98.2 percentile

[golden dragon]

hows ur mental health status studyin gthis

[hushed badge]

umm its fine

I studied for 1 year

[golden dragon]

💀 🙏

lemme guess exam 2 hours?

[hushed badge]

3 hours

paper 1 and paper 2

[golden dragon]

thats explains alot

[hushed badge]

paper 1 -> 3hrs

paper2 -> 3hrs

with a gap of 1 hour

jee advanced comprises of two papers paper1 and paper2

both of them are 3 hours long

[golden dragon]

but all of that

it does not help in software engineer

[hushed badge]

yes

indian education is f'ed up

[golden dragon]

why

i thought mine is worst

[hushed badge]

you have to study physics even you want to become a doctor

[golden dragon]

unnessary requirement eh?

[golden dragon]

ptsd

[hushed badge]

forget about doind I can't even understand the question

[golden dragon]

compare your brain to ram and cpu

i bet it probably melt

[hushed badge]

yup lmao

[golden dragon]

thats only mention to reading part

[hushed badge]

hey but I cleared jee mains which is an easier version of this exam

[golden dragon]

havent mention about solving it

so if you clear jee main you can forgot about jee advanced right?

or you need to pass it

[hushed badge]

basically if you clear jee advanced you would get the oppurtinity to study in iit(indian institute of technology)

you can consider them as ivy's of india

[golden dragon]

woah hoh

but if you dont pass it you get basic uni right

[hushed badge]

first of all only those candidates who have cleared the jee mains can sit for jee advanced

[hushed badge]

no no I am also in one of the best uni of india

[golden dragon]

sheesh

so it means that since ur in best uni you dont need to take jee advanced

[hushed badge]

basically see it like this there are iit's but there are many more universities which are not iits but are very good and and better than a lot of iits

[hushed badge]

some unis accept jee mains score but iits only accept jee advanced score

but the cutoff for my uni is also 98 percentile

[golden dragon]

thats alot

[hushed badge]

I socred 98.2

[golden dragon]

actually how you good at math tho

reading or practicing

[hushed badge]

no math was my weakest area

[golden dragon]

cap

[hushed badge]

physics was my strongest

[golden dragon]

bro teaching me like a professor just now

[hushed badge]

I scored 99.6 percentile in physics 98.1 in chem and 90.2 in maths

[hushed badge]

lol

[golden dragon]

🙏 master

[hushed badge]

you can see the paper which I gave

[golden dragon]

do you really do alot of reading

[hushed badge]

no no

currently I am doing codeforces

and web dev

you know that the stuff they teach in uni is not important in real life

if you want to work in corporate you would have to do dsa

[golden dragon]

huh raeally?

[hushed badge]

yes its of no use unless you are going for research

[golden dragon]

no i mean like how you really good at something tho

lets say physics & math etc

do you listen lect the most , reading or practicing

[hushed badge]

nope

I sleep in lectures lmao

I study most of the stuff from youtube

you know that there are many indian tutorials

[golden dragon]

take notes or no

[hushed badge]

nope

[golden dragon]

indian tutorials are goated bruh

[hushed badge]

I consider taking notes as a waste of time

[golden dragon]

without them where are we

any tips for me

im trying to be a good student "for now"

[hushed badge]

yes for gpa

I only study for gpa

[golden dragon]

whats ur tips on study

im in degree rn

[hushed badge]

which courses do you have

I can find some playlists for you

[golden dragon]

uhh object oriented

computer math

[hushed badge]

object oriented what