#help-13

1 messages · Page 314 of 1

hot crag
#

uhhh

crimson sedge
#

,w expand a^2+(a+2)^2+(a+4)^2+1

hot crag
#

okay

#

now we know that a is an odd integer

lyric narwhal
#

Oh this should be easy then

hot crag
#

and the middle term is always divisible by 12

#

so all that's left is 3a^2 + 21

#

now, what form are squares of odd integers always in

crimson sedge
#

either 3k or 3k+1

hot crag
#

...

#

that applies to even integers too

lyric narwhal
crimson sedge
#

Oh

hot crag
#

odd perfect squares but are a specific type

#

they can always be represented as 8n + 1

#

try it

#

the proof is quite fun too

#

albeit simple

crimson sedge
#

Oh yeah n triangular

hot crag
#

was the first proof i ever did

#

so we know that a^2 = 8n + 1

#

substitute that in

lyric narwhal
hot crag
#

what do you get

crimson sedge
#

24n + 24

hot crag
#

mhm

#

there's your answer

crimson sedge
#

Damn, I over complicated it monkey

hot crag
#

xD

#

happens a lot

crimson sedge
#

Thanks 👍

hot crag
#

it's just by chance that i decided to expand it and noticed this

#

np

#

anything else?

#

if not

cedar kilnBOT
#

If you are done with this channel, please mark your problem as solved by typing .close

crimson sedge
#

Sure

#

.close

cedar kilnBOT
#
Channel closed

Closed by @noble yoke

Use .reopen if this was a mistake.

hot crag
#

have a good day

cedar kilnBOT
#
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.

wispy brook
#

Need help on this number 3 question

cedar kilnBOT
idle tusk
#

,rotate

wraith daggerBOT
brave copper
#

yea i cant even read that

idle tusk
#

there's an english translation

karmic cairn
brave copper
#

ah

wispy brook
#

its mixed up, mb

idle tusk
wispy brook
#

a1 and a2

cedar kilnBOT
#
What step are you on?
1. I don't know where to begin.
2. I have begun but got stuck midway.
3. I got an answer but I was told that it's wrong.
4. I got an answer and would like my work checked.
5. I have a question about someone else's work/solution.
6. I have completed the problem and don't need help anymore. Thank you.
7. None of the above
wispy brook
#

1

idle tusk
#

well

#

for both of them, you just have to do the transformations on just point V

#

let's try a1

idle tusk
# wispy brook 1

X is a reflection along the line x=4. can you show where V ends up after X?

#

hint: this is where the line x=4 is

wispy brook
#

wait, i am taking the pic now

austere pawn
#

What a reflection is, is a transformation along a line where any point doesn't change its y-value and the x-value is the same distance but in the opposite direction of the line

#

In this case*

cedar kilnBOT
#

@wispy brook Has your question been resolved?

wispy brook
#

like this?

#

Like this?

cedar kilnBOT
#
Channel closed

Closed due to timeout

Use .reopen if this was a mistake.

cedar kilnBOT
#
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.

potent flower
#

1+6C5+7C5+8C5+...+49C5 = ..........

cedar kilnBOT
potent flower
#

how to start with this

crimson sedge
#

whats the question

potent flower
#

look at the edited version

#

I'm dumb

crimson sedge
#

the original question

potent flower
crimson sedge
#

wheres it from

upper laurel
#

youll need to post a screenshot or a picture of the question instead of typing it out

crimson sedge
#

i dont think any work sheet/book/site will only say that as its really ambiguous

potent flower
spiral stag
#

What does C mean?

potent flower
#

choose

crimson sedge
grand shale
spiral stag
#

ah

potent flower
grand shale
#

hockey stick identity

potent flower
grand shale
#

look it up

potent flower
#

cuz I've not taken this before

grand shale
#

thats the easiest one

#

what is kck + k+1 c k?

potent flower
grand shale
#

try using algebra

vestal quarry
#

Find Range of f(θ)=2cos
2
θ−6sinθ+1

potent flower
potent flower
grand shale
#

Mhm

potent flower
#

like splitting every term

grand shale
#

now extend it

potent flower
potent flower
grand shale
#

yep

#

try it out

potent flower
#

it will become 7+ 7C5 + .......

grand shale
#

kck + k+1 c k + k+2 c k = k+1 c k+1 + k+1 c k + k+2 c k= k+2 c k+1 + k+2c k = k+3 c k+1

potent flower
#

I don't understand anything

#

ah now I get it

grand shale
#

Alr

potent flower
grand shale
#

its not

potent flower
#

k+1 c k+1 + k+1 c k + k+2 c k= k+2 c k+1 + k+1 c k

potent flower
grand shale
#

read ir properly

potent flower
#

that I know

#

then the last term is k+2ck

#

and the other term on the rhs is k+1ck

#

ha?

grand shale
#

corewcred ir

#

correected it

potent flower
#

now I got it

#

thnx

#

.close

cedar kilnBOT
#
Channel closed

Closed by @potent flower

Use .reopen if this was a mistake.

cedar kilnBOT
#
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.

zealous mauve
#

Hi

cedar kilnBOT
zealous mauve
#

I need help finding determinatn of this matrix

#

with #9

#

Here are my steps

#

3 -6 9
0 3 4
0 1 5

#

3 -6 9
0 3 4
0 0 -11

#

then determinatn should be -11 * 3 * 3 which is -99

#

but book answer is 33

plucky owl
mental trail
#

you multiplied row 3 by -3 didn't you?

#

and you didn't multiply the determinant by 1/(-3) in consequence

zealous mauve
plucky owl
#

But you had to multiple the third row by -3

mental trail
#

you did R3 <- -3R3 + ...R2

zealous mauve
#

oh so like is thhe third point wrong here?

#

sorry for the twisted image

mental trail
#

,rotate

wraith daggerBOT
zealous mauve
#

2.2.3 C

#

because doesn't it say multiple?

mental trail
#

no it's not wrong. the theorem is correct in the sense that

zealous mauve
#

or did I misunderstand

mental trail
#

it doesn't say "when a multiple of one row A is added to a multiple of another"

#

it says "when a multiple of one row A is added to another"

zealous mauve
#

ah

mental trail
#

which means

#

the row to which is added another one

#

can't change factor

zealous mauve
#

got it

#

Thanks

cedar kilnBOT
#

@zealous mauve Has your question been resolved?

cedar kilnBOT
#
Channel closed

Closed due to timeout

Use .reopen if this was a mistake.

cedar kilnBOT
#
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.

frail yoke
#

can someone explain the answer, I guesssed it but I have no idea

long arrow
#

well, do you recognize what kind of transformation does f(x-2) - 1 describe?

frail yoke
#

Shift up 1 I think and shift 2 right

long arrow
#

2nd part is correct, the 1st one is not

frail yoke
#

So down?

long arrow
#

yes

#

so it makes the point given move 2 units right and 1 unit down

#

hence:

frail yoke
#

Oh I understand now

#

It's shifts

long arrow
#

-4 + 2 = -2
-5 - 1 = -6

frail yoke
#

Thank you!! I thought it was something else

#

And shift up would have been +# outside () right?

long arrow
#

yeah

frail yoke
#

Alright thanks 👍

#

.solved

cedar kilnBOT
#
Channel closed

Closed by @frail yoke

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.

glass spruce
#

prove that the two sequences converge to the same limit:

glass spruce
#

a1 > b1 > 0

south tundra
#

Note that the sequence of products (p_n defined by p_n = a_nb_n) is constant, this will simplify the sequences

glass spruce
#

i have no idea where to start on this

south tundra
#

Also, are you sure this is everything that's given?

glass spruce
#

yeah but then what

south tundra
#

Anyway, you get that a_{n+1} = 1/2 (a_n + p/a_n) where p is the constant that I mentioned

#

Note p > 0

twilit escarp
glass spruce
#

isnt p_n = a_1(b_1)?

south tundra
#

Using monotone convergence theorem, you can show a_n converges and find it's limit using the recursive formula

south tundra
glass spruce
south tundra
#

The theorem states that if a sequence is monotone decreasing (resp. increasing) and bounded below (resp. bounded above), then it converges

glass spruce
#

ah

south tundra
glass spruce
#

oh

#

and where did you get that from?

twilit escarp
south tundra
twilit escarp
twilit escarp
daring kelp
#

Alternatively $0<=a_{n+1}-b_{n+1}=\frac{a_n-b_n}{2}\cdot\frac{a_n-b_n}{a_n+b_n}<\frac{a_n-b_n}{2}$. So the differences between the terms of the sequences is strictly decreasing and it's bounded below by 0, so the differences converge to 0 meaning they have the same limit.

wraith daggerBOT
#

Daniel

south tundra
#

Hmm, a_{n+1} - p/a_{n+1} is gonna be (a_n + p/a_n)/2 - 2p/(a_n + p/a_n)

#

Maybe could work but showing convergence to zero of the difference will be cumbersome

twilit escarp
glass spruce
#

how did you know that the sequences are monotone?

south tundra
daring kelp
#

Mb it doesnt

south tundra
#

Let s_{n+1} = 1 + 1/s_n, we have 0 < s_n < s_{n+1} but not s_n -> 0 whenever s_1 > 0

daring kelp
#

No surely it does

#

If we take the $i$'th term then we have $a_i-b_i<\frac{a_1-b_1}{2^i}$

wraith daggerBOT
#

Daniel

daring kelp
#

RHS can obviously be made arbitrarily small by taking i big enough

south tundra
#

That's better

daring kelp
south tundra
glass spruce
#

ah right

#

and how can i prove that a_n is monotone?

south tundra
#

Solve the inequality a_{n+1} <= a_n, make sure each step is an equivalence so that writing them from bottom up will result in the proof of being monotone decreasing

#

But actually before that you need to know the lower bound in this case

glass spruce
#

i get that a_n > b_n

#

why is that useful?

south tundra
#

a_n > b_n is irrelevant to the solution I'm presenting

glass spruce
#

what am i supposed to get?

#

a_n > p_n/a_n

south tundra
south tundra
glass spruce
#

how can i know the infimum?

south tundra
#

But you can't show that yet

glass spruce
#

it doesnt prove that its descending

south tundra
glass spruce
#

but wouldnt its limit be the infimum only if its montone?

south tundra
#

In this case yes

glass spruce
#

so id need to prove its montone first

south tundra
#

You don't need to prove that what you found is the infimum when you are proving the theorem

south tundra
glass spruce
south tundra
#

Again, assume the sequence to converge, you will find out the infimum and then show that this is the lower bound without the assumption of convergence

#

And then monotonocity follows

south tundra
glass spruce
#

right but how did you know that the sequence is monotone?

#

intuitively i mean

#

like how did you think of that?

south tundra
#

Hmm, a natural way would be to just guess that by looking at the first terms, then discover that you need a_n >= sqrt(p) for that to happen, so you try to see if you can prove sqrt(p) to be a lower bound first

#

My personal answer is that I've seen this family of sequences already in an exercise which contained the hints that I am suggesting

glass spruce
#

right

#

so how do i prove the its the infimum?

south tundra
#

Again, you don't need to prove that it's the infimum, for now think of this as guessing

glass spruce
#

guessing what?

south tundra
#

Either way, show that sqrt(p) is a lower bound and then that the sequence is monotone decreasing

glass spruce
#

what does power bound mean?

south tundra
south tundra
glass spruce
#

ok and how do i show that its a lower bound?

south tundra
#

It can be done by induction

glass spruce
#

is there something shorter? lol

south tundra
#

Hmm the base case is not so obvious though

#

Actually

#

a_1 > b_1 can be used for the base case

glass spruce
#

oh yeah

#

actually why are we proving that a_n is monotone?

#

the question wants us to prove that they converge to the same limit first, then to find that limit

south tundra
#

To apply monotone convergence theorem

#

And then find the limit using the recursive formula

#

Once the limit of a_n is known, so will be the limit of b_n

glass spruce
#

then wed have to do the same thing for b_n no?

south tundra
#

No

#

b_n = p/a_n

glass spruce
#

oh

south tundra
#

So you will have b_n -> p/(limit of a_n)

glass spruce
#

but then why does it want us to find the limit later?

#

i think im supposed to solve this differently

glass spruce
south tundra
#

There was a different solution proposed above which doesn't involve actually finding the limits

glass spruce
#

ah

#

you know what lets continue this one

#

so we have the base of the induction

south tundra
#

Right

glass spruce
#

so i need to prove that p/a_n > sqrt(p)

south tundra
#

One thing I realized just now is that induction isn't necessarily, AM-GM suffices

glass spruce
#

what's that

south tundra
south tundra
# glass spruce what's that

It states that the arithmetic mean of nonnegative real numbers is greater than or equal to their geometric mean

#

In the case of just two numbers, it says (x + y)/2 >= sqrt(xy) when x, y >= 0

glass spruce
south tundra
#

The last step doesn't seem valid, a_n >= sqrt(p) and a_n + p/a_n >= 2sqrt(p) does not imply sqrt(p) + p/a_n >= sqrt(p)

#

You could rather use the fact that p/a_n <= p/sqrt(p) = sqrt(p)

glass spruce
#

thats what i meant by the question mark

south tundra
#

I see

glass spruce
south tundra
#

Anyway, this shows that sqrt(p) is a lower bound

wraith daggerBOT
#

sibber

south tundra
wraith daggerBOT
#

A Lonely Bean

glass spruce
#

done i need to prove that its bigger?

south tundra
#

What's bigger than what?

glass spruce
#

p/a_n > sqrt(p)

south tundra
#

No, that's not even true

glass spruce
#

yeah thats what confused me

#

you just proved the opposite lmao

south tundra
#

p/a_n <= sqrt(p) and then a_{n+1} >= sqrt(p) follows

glass spruce
#

how does it follow

#

i need to prove that a_n + p/a_n >= 2sqrt(p)

#

and what i have is that p/a_n <= sqrt(p)

#

and a_n > sqrt(p)

south tundra
#

Hmm, you are right, I messed up somewhere

#

Weirdly enough I remember proving this by induction somehow

glass spruce
#

lol

#

no worries

south tundra
#

Either way we can forget about induction and use am-gm

glass spruce
#

ill just use the average inequaloty

#

yeah

#

so now i know that a_n+1 has a lowerbound

#

how do i prove its monotone

south tundra
#

You already did this and ended up with a_n >= sqrt(p), which has just been proven

glass spruce
#

oh right

south tundra
#

So we've shown the sequence to be monotone decreasing and bounded below

#

This means that it converges

#

The limit can be found by letting n -> infinity in the equation a_{n+1} = (a_n + p/a_n)/2 (you might want to name the limit with a letter)

glass spruce
#

wait

#

we proved that a_n+1 >= sqrt(p)

#

not that a_n >= sqrt(p)

south tundra
#

But the principle induction tells us that what we've shown is enough to conclude a_n >= sqrt(p) for all n

glass spruce
#

oh its still induction

south tundra
#

Choose a letter to name the limit of a_n

glass spruce
#

t

south tundra
#

You have a_n -> t and a_{n+1} -> t, so t = (t + p/t)/2

#

Solve for t

#

Keep in mind that t is positive

glass spruce
#

is there a theorem that states that shifting sequences doesnt change the limit?

south tundra
#

Pretty sure there's no conventional name for it, it is too obvious for that

glass spruce
#

lol yeah but ive seen obvious things that do have named theorems

#

anyway

#

does limit arithmetic allow me to do lim bn = p/(lim an) ?

south tundra
#

Yes

#

This is one of the properties of limits

glass spruce
#

great

#

so were done

south tundra
#

Pretty much, yeah

#

One more note

glass spruce
#

thanks a lot!

south tundra
#

Turns out a1 > b1 is not necessary for the problem

#

a2 >= b2 holds regardless of how a1 and b1 compare

glass spruce
#

why is that

south tundra
#

(a1 + b1)/2 >= 2a1b1/(a1 + b1)
(a1 + b1)^2 >= 4a1b1
a1^2 + 2a1b1 + b1^2 >= 4a1b1
a1^2 - 2a1b1 + b1^2 >= 0
(a1 - b1)^2 >= 0

#

Each step is an equivalence (as long as a1 + b1 is nonzero, which holds in this case)

#

And the last inequality is true for all a1, b1 in R

glass spruce
#

oh yeah

south tundra
#

Actually we didn't really make use of a1 > b1 anyway so nvm

glass spruce
#

we did in the induction base

south tundra
#

We ditched induction

glass spruce
#

isnt that how we proved a_n >= sqrt(p)?

south tundra
#

No, we used am-gm on a_{n+1}

#

And n+1 is an arbitrary integer >= 2

glass spruce
#

yeah and we assumed that its true for a_n

south tundra
#

Which makes sense

south tundra
glass spruce
#

oh

#

i guess we dont need that for limits

south tundra
#

Anyway, is everything clear?

glass spruce
#

yup

#

im writing it now so i make sure before i close this

#

thanks again!

#

.close

cedar kilnBOT
#
Channel closed

Closed by @glass spruce

Use .reopen if this was a mistake.

cedar kilnBOT
#
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.

vernal field
#

what does this mean

cedar kilnBOT
vernal field
#

what does the E[X_i | X_1, ..., X_i-1] = X_i-1 thing mean? it's really confusing lol

#

thanks

astral bay
#

i'm guessing it's like

#

if $X_1, X_2, \dots, X_{i-1}$ have ``already happened'' (if we know what their value are)

wraith daggerBOT
#

bee [it/its]

astral bay
#

then the expected value of $X_i$ is the same as whatever the value of $X_{i-1}$ was

wraith daggerBOT
#

bee [it/its]

astral bay
#

...maybe

worn meteor
#

.help

cedar kilnBOT
#

Commands:

  • clopen: .close, .reopen
  • consensus: .poll
  • factoids: .tag
  • help: .help
  • version: .version

Type .help <command name> for more info on a command.

astral bay
#

does that make any sense? it's 2 am i'm not necessarily particularly coherent

worn meteor
flint plinth
worn meteor
#

Pls slove this

flint plinth
#

the basic points being: if you have the entire "history" x_1 through x_n, and you want to know the expected value of X_(n+1) given this history:
(1) only X_n is relevant
(2) and the expected value given the history is X_n itself, meaning your best guess as to what happens next is what happened most recently

cedar kilnBOT
#

@vernal field Has your question been resolved?

cedar kilnBOT
#
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.

dull briar
#

5

cedar kilnBOT
dull briar
crimson sedge
dull briar
#

i did it wrong judjing with answers

#

the thing is it is miswritten

#

or i am stupid

crimson sedge
#

Unless there is something I don't know about the question, I believe this is solvable

dull briar
#

so help me to solv it

crimson sedge
#

Show me what u did :p

dull briar
#

youre here to do it

#

why should i

crimson sedge
dull briar
#

so what it for,

#

?

crimson sedge
#

To help u do it and ideally learn, we not allowed to give out answers u gotta work for em

dull briar
#

ok

#

so

#

i multiply 3 in first bracket so i have (3w-3\2)

#

then i multiply (3w-3\2) to (w+1\4)

#

and here where awaerthing goes wrong

#

resolver says

#

that

#

it should be

#

3w>2 - 3\4w - 3\2 w -3\8= 2w>2-3\4w

#

but i have

#

3w>2 + 3\4w - 3\2 w -3\8= 2w>2-3\4w same but here is positive

#

so when i pass -3\4w through ecual i cant delete them

#

do you understand,

#

???

crimson sedge
#

I believe the resolver- whatever that is lol- is right

dull briar
#

why i get his positive

#

3w>2 + 3\4w why is it positive ??? it should be negative but i get it positive

crimson sedge
#

You likely swapped the signs of the 2nd and 3rd step, or at least that makes the most sense

#

Idk if this helps but personally I'd do the 3 last in the multiplying, that way there's less variables- it's closer to squaring a binomial

#

That's just a preference though

#

But I mean you did the hard part of the math tbh 😄 just a sign issue

crimson sedge
#

You're wrong I'm right 😎
So uh I 2nd guessed myself and you were right lol, you can see this because I did exactly what you did and got your same answer and just simplified it too far then misread something lmao mb, but yeah you are right that should be where you are

#

In that case idrk what resolver is doing 🔥

crimson sedge
#

Damn I feel goofy now ngl 😩

dull briar
#

can i get another person please because there is a lot of slang a lot of words but not the exact reason why i am wrong

crimson sedge
#

No I'm saying you're right

dull briar
#

again

#

the answers are

#

and i cant get them

#

do you get my confusion write now?

#

@crimson sedge ????

#

sombody pelase help me

#

why should i wait

#

???

#

moderators,

crimson sedge
#

I thought you wanted someone else but sure I can

#

Your answer was correct I just made an error

#

The program thing whatever is wrong

crimson sedge
dull briar
#

i dont get the answer

crimson sedge
#

Well for starters, where did the (8w^2)/16 come from in the last 2 you wrote?

dull briar
#

3\4w multiply to 3/4w

#

ohhh

#

ok

crimson sedge
#

Yeah no reason for that- in fact the terms with just w are the easiest cause they perfectly combine to 0

dull briar
#

no they not

crimson sedge
#

-3w/2 +2(3w/4)

dull briar
#

they are opsitive

#

both

#

thats the problem i cant get zero

#

i should sume them

#

they are both positive

crimson sedge
#

When combined they make 3/2, and that cancels the negative 3/2 we already have

dull briar
#

and 2w,,

#

цруку ше пуеы

#

where it goes

#

they are 3\4w +3\4w

crimson sedge
dull briar
#

we have

#

3w^2+ 3\4w+ 3\4w- 3\2w- 3\8 -2w^2=0

crimson sedge
#

Correct

#

Now just combine like terms

dull briar
#

3\4w +3\4w= 2 3\2w

crimson sedge
#

Did you mean to put the 2 before 3/2?

dull briar
#

yes

#

i am dying so criiinge

crimson sedge
#

Just checking not being degrading lol, though it would be 3/2: 3/4 + 3/4 = 6/4 = 3/2

crimson sedge
dull briar
#

they cant they have 2 before them

#

becaouse we have 2 w

crimson sedge
#

I do not get what you mean, why would they not combine? We still have more to do but we would reach 3w^2 - 2w^2 - 3/8 = 0 after doing that

dull briar
crimson sedge
#

Where do you get 2(3/2) though? That is 4x the value of 3/4

crimson sedge
dull briar
#

w

#

w+w=2w

#

what the heck

#

w is connected to 3\4

#

we cant just conbine them without w

#

it should be negative

crimson sedge
#

Am I right about your thoughts or no?

dull briar
#

i

#

just

#

want

#

you

#

to explain me why i have

#

second exponent positive

dull briar
#

i have the same but second exponent postive

#

if i had it negative

#

but i dont have it negative

#

so i have trouble why?

#

@crimson sedge can you answer that question

crimson sedge
#

Variable not exponent (just so you don't confuse someone :p) and you have the same thing they just simplified to a further point which I'm trying to get you to do but you won't follow where I'm trying to take you, but I'll answer you anyway, if there's something stopping you from fully reading my messages let me know and we can try to work something out

On the left side you put
3x^2 + 3w/4 - 3x/2 - 3/8
They put
3x^2 - 3w/4 - 3/8
If we combine like terms in the work you were doing, you would get
3x^2 - 3w/4 - 3/8
Which is what I was explaining how to do

#

You have the same thing they just combined like terms

dull briar
dull briar
#

i seeeeeeeeeeeeeeeeeeeeeeeeeeee

#

they are soooooooooooo freeky

#

okey

#

i have

#

they are not correct

crimson sedge
#

Well what you have isn't correct

crimson sedge
dull briar
#

okey

#

let do everything step by step

#

AGAIN!!!

crimson sedge
#

But you didnt answer me still lol

dull briar
#

i am so confused that i cant answer yo

crimson sedge
#

So you said that you should multiply 3/2 by 2, because they both have a w, right? Therefore 3w/4 + 3w/4 = 2(3w/2)

#

Or am I wrong?

dull briar
#

yes]

#

the error is the -

#

it should be -

#

but i get +

crimson sedge
# dull briar yes]

Alrighty that helps, cause now I know its an issue with your fundamental algebra
I'll reference what you said before
w + w = 2w
That makes sense, but what about this?
2w + 2w = 8w
You can probably see there is only 4 w's, but with your logic there should be 8 since the w's double it, which is false, when adding variables you simply add their coefficients, so in that case the coefficients are both 2, so we simply add 2
2w + 2w = 4w
Which makes sense! So what about the first problem which your proposed? Remember that if a variable doesn't have a written coefficient, the coefficient is actually 1, so that is the same as
1w + 1w = 2w

dull briar
#

why,

crimson sedge
#

So same there, 3x/4 + 3x/4, you add the coefficients, 3/4 + 3/4 = 3/2, so that equals 3x/2

crimson sedge
crimson sedge
dull briar
#

i will jump in the window right now

crimson sedge
#

That's essentially what you were doing to get 2 (3/2)

#

You added them together, but multiplying by 2 because of the variable is wrong, you should have only added the coefficients

crimson sedge
dull briar
#

okey

#

but

#

same

#

WRONG ANSWER

#

WRONG BECAOUSE WE HAVE + AND NOT -

crimson sedge
#

Idk why you have + now

#

You even called it freeky

dull briar
#

you cant amagine in what codition i am now

#

i dont understand anything

#

AAAAAAAAAAA

#

I GOT IT I GOT IT

#

I GOT IYTTTTT

#

T

#

TTT

#

T

#

TT

crimson sedge
#

Ooh?

dull briar
#

YEEEEEES

#

BUT I STILL

#

dont understand

#

why

#

3\4x + 3\4x =3/2x and not to 2 3\2x

#

is that becaouse they are one type

#

and x is not envolved in action and just like "familiraty sign"

crimson sedge
#

Yeah because they're like terms it's easier

#

Say 3/4 = y
yx + yx = 2yx
2y = 2(3/4) = 3/2

#

If that helps any too

#

Just touch on some of your fundamentals

dull briar
#

not it makes m even more confused

crimson sedge
#

Thats fine lol youll figure it out

dull briar
#

.close

cedar kilnBOT
#
Channel closed

Closed by @dull briar

Use .reopen if this was a mistake.

cedar kilnBOT
#
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.

acoustic quartz
cedar kilnBOT
acoustic quartz
#

What function should i use to compare this to see if it converges or diverges

#

?

formal sierra
#

uh

#

you can ignore the 1 right

#

so like

#

x/(e^x*x^3)

acoustic quartz
#

yea

formal sierra
#

so just 1/e^x(x^2)

#

which should be inituitive

acoustic quartz
#

wdym

formal sierra
#

uh like 1/e^x converges

#

so

#

thats hould converge

acoustic quartz
#

how did u figure out which function to compare it to so quickly tho

formal sierra
#

like basically for comparison

acoustic quartz
#

cause i tend to have trouble with finding which function i should use to compare

formal sierra
#

you remove all things that would be unesecary

#

i cant spell

#

so here 1 is very small right?

acoustic quartz
#

its fine i understand u 🙏

#

ye

formal sierra
#

most likely wont matter

#

just remove it

acoustic quartz
#

So stuff with more weight basically?

formal sierra
#

yes

#

stuff without weight you can remove

acoustic quartz
#

so the x in the numerator i can just make that 1 right

#

cause that has no weight in comparison to e^x?

#

or

formal sierra
#

yeah cause it cancels out with bottom

#

nah keep it

acoustic quartz
#

wdym cancels out with the bottom?

formal sierra
#

x/x^3

acoustic quartz
#

x^-2

formal sierra
#

yes

acoustic quartz
#

but x^-2 in comparison to e^-x is nothing right so i can remove that?

formal sierra
#

theres not really like a perfect thing to compare it to

#

yeah you can remove it but it shouldnt matter

#

as long as you can know it will converge

#

do you know p series test?

acoustic quartz
#

yes

#

the p >= 1 converges

formal sierra
#

ye so its x^2

#

2>=1

#

its > not >= btw

#

for p series test

acoustic quartz
#

oh

formal sierra
#

1/x does not converge

acoustic quartz
#

oh right

formal sierra
#

dont think about it too hard

#

if it looks like it converges in hindsight

#

it probadly does

#

and any exponents at bottom is almost automatically a converge

acoustic quartz
#

okok

#

makes sense

#

thanks so much

formal sierra
#

np

cedar kilnBOT
#

@acoustic quartz Has your question been resolved?

#
Channel closed

Closed by @acoustic quartz

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.

glacial jetty
#

I need to make sure my math is mathing
If I price something at 9.99 and they take 12% I will get 8.79

mighty shuttle
#

!status

cedar kilnBOT
#
What step are you on?
1. I don't know where to begin.
2. I have begun but got stuck midway.
3. I got an answer but I was told that it's wrong.
4. I got an answer and would like my work checked.
5. I have a question about someone else's work/solution.
6. I have completed the problem and don't need help anymore. Thank you.
7. None of the above
glacial jetty
#

Ok thanks

#

.close

cedar kilnBOT
#
Channel closed

Closed by @glacial jetty

Use .reopen if this was a mistake.

glacial jetty
#

.reopen

cedar kilnBOT
#

glacial jetty
#

How do I close this thing

rotund fox
glacial jetty
#

.close

cedar kilnBOT
#
Channel closed

Closed by @glacial jetty

Use .reopen if this was a mistake.

cedar kilnBOT
#
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.

potent ledge
#

Anyone know how to do this?

cedar kilnBOT
potent ledge
#

Idk how to start

lone schooner
clear umbra
potent ledge
potent ledge
lone schooner
clear umbra
#

well after using it you should have 4sinθcosθ = sinθ right?

lone schooner
potent ledge
lone schooner
#

4 = secθ

potent ledge
clear umbra
#

which is = 0

potent ledge
#

Yes

clear umbra
#

but for a fraction to equal 0 the numerator has to be 0

#

so you have 4sinθcosθ - sinθ = 0

potent ledge
#

I see

clear umbra
#

then what should you do after

potent ledge
#

Take out sin theta

#

Hence those two factors are separately equal to 0?

clear umbra
#

yep

potent ledge
#

Ohh I see tysm!

lone schooner
#

@potent ledge see for θ = 0,pi,2pi,...,npi it's satisfying

now go for values of θ in which sinθ and tanθ are not 0 in those values you can cut out sinθ and write it as 4 = secθ then
θ = sec^-1 4

#

this will save you the identities

potent ledge
#

Hmm I see

#

Thank you!

#

.close

cedar kilnBOT
#
Channel closed

Closed by @potent ledge

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.

thorn robin
#

How many pairs of solutions (m, n) exist for the equation n = √(100 − m^2)where both
m and n are integers?

apprently the answer is 7

however what i did was n^2 = 100-m^2
n^2+m^2 = 100

n, m can be

6,8
-6,8
6,-8
-6,-8
8,6
8,-6
-8,6
-8,-6
0,10
0,-10
-10,0
10,0

so there should be 12 solutions?

humble karma
#

They probably don't count pairs of the form (a,b) and (b,a) to be distinct.

thorn robin
#

oh ok, but if that's the case shouldn't there be 6 solutions?

sacred grail
#

(n, m)

  1. 6,8
  2. 6,-8
  3. 8,6
  4. 8,-6
  5. 0,10
  6. 0,-10
  7. 10,0
thorn robin
sacred grail
#

they are not solutions

thorn robin
#

ohh

#

so u have to substitute into main equation and see ?

sacred grail
#

n = √(100 − m^2)

#

clearly n is non-negative

thorn robin
#

ohh ok thanks

#

.close

cedar kilnBOT
#
Channel closed

Closed by @thorn robin

Use .reopen if this was a mistake.

cedar kilnBOT
#
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.

crimson sedge
#

evaluate the limit $\lim_{x \to 0} \frac{\sin{x}}{1 - \cos{x}}$

wraith daggerBOT
#

Emploice Muswashans

crimson sedge
#

Shouldn't this evaluate to undefined

formal prism
#

Use L hopital

livid hound
#

why do you think this is undefined?

crimson sedge
#

we have a little rule to evaluate the limits that are indeterminate 🤗

crimson sedge
#

thanks

#

.close

cedar kilnBOT
#
Channel closed

Closed by @eager tusk

Use .reopen if this was a mistake.

cedar kilnBOT
#
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.

swift fossil
#

using series how can i find the fraction that represents 1.24123123123123... i am having trouble finding out what n is in 123(1/10)^(n-1) in the series

digital cliff
#

you sure your series expression is correct?

swift fossil
#

I dont think it is

crimson sedge
#

yeah seems like it to me as well

digital cliff
#

indeed it is not

swift fossil
#

but i know it has to be solved using geom series because that is what we learned

crimson sedge
#

can you send the entire question?

swift fossil
#

yea sure one sed

#

sec

digital cliff
#

you can write it as 0.01+1.23123123...
the second bit is 1.23(1/?)^(n-1), what would ? be?

swift fossil
#

question 29

digital cliff
#

what is ?

swift fossil
#

i was able to do 23 with ease but the next one assigned is 29 which i am having trouble with

crimson sedge
#

I am not quite sure how we would solve this with geometric series

#

but I know another method

swift fossil
#

go ahead maybe its something we learned that i am not recalling

crimson sedge
#

let's say we have $x = 1.24 \bar{123}$

wraith daggerBOT
#

Emploice Muswashans

crimson sedge
#

oh damn it didn't bar the whole thing

#

weird

#

one sec

swift fossil
#

thats fine

crimson sedge
#

I'll jut write it in my notebook and send

swift fossil
#

ok thanks

digital cliff
lament iris
#

i think i have a thing for ya

#

is it ok if i send a ss for yyou

swift fossil
swift fossil
lament iris
crimson sedge
#

yeah exactly

#

that's what I was doing

#

split of the 1.24 from the repeating decimals

lament iris
#

yep

crimson sedge
#

and then convert the repeating decimals

#

into a fraction

swift fossil
crimson sedge
#

if you have 0.123123..... its pretty easy to convert that

digital cliff
swift fossil
#

1000

digital cliff
#

correct

#

so you have 1/100 + (sum to infinity)

swift fossil
#

no but there are 2 decimal places and then 3

digital cliff
#

1.23 + 0.00123

#

thats the first two terms

#

division by 1000

swift fossil
#

let me try in my notebook

crimson sedge
swift fossil
#

ohh you are right

#

got it

#

thank you guys

#

i hate series so much

#

.close

cedar kilnBOT
#
Channel closed

Closed by @swift fossil

Use .reopen if this was a mistake.

cedar kilnBOT
#
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.

rigid hazel
#

hey could i get help with putting this in the final form it wants in this question, i am on e and have done the rest of the questions

rigid hazel
#

this is what i have done

frozen spindle
#

,rotate

wraith daggerBOT
frozen spindle
#

you're good, just use the stirling approximation and take the limit

rigid hazel
#

whats the stirling approximation

#

and how do i get m^k in my numberator and not j^k

#

@frozen spindle

#

im still a bit confused

#

.close

cedar kilnBOT
#
Channel closed

Closed by @rigid hazel

Use .reopen if this was a mistake.

molten compass
rigid hazel
#

ah ok

#

im not sure how this helps n

frozen spindle
#

I just meant the formula they gave you

#

(it's really stirling in disguise, I didn't realize they didn't tell you that)

rigid hazel
#

thats ok

frozen spindle
#

are you allowed to use the fact that e^x = (1+x/N)^N

#

if not, then you can derive that first

rigid hazel
#

i did not know that, how would you derive it?

#

does it get rid of my j^k in the numberator as in the formula i need an m^k

molten compass
#

isn't that just a dummy variable thing

rigid hazel
#

im only a first year physics student aha sorry must seem i dont know a lot

frozen spindle
#

e = lim (1+1/N)^N [N \to \infty], replace N with N/x and we get
e = lim (1+x/N)^(N/x) [N/x \to \infty], which entails by some limit rule that
e = (lim (1+x/N)^(N) [N/x \to \infty])^(1\x), if x is fixed then we can just take the limit and get
e = (lim (1+x/N)^(N) [N \to \infty])^(1\x), raising both sides to x we get
e^x = lim (1+x/N)^(N) [N \to \infty]

#

there might be a shorter way to do that, I'm going off of memory here

rigid hazel
#

cool

frozen spindle
# wraith dagger

but the point is that with this in hand, we do the little binomial expansion trick here

cedar kilnBOT
#
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.

tribal sonnet
#

|L(M)|
M is a turing machine
what does this means?
length of strings in L is less than 3?

cedar kilnBOT
#

@tribal sonnet Has your question been resolved?

cedar kilnBOT
#

@tribal sonnet Has your question been resolved?

cedar kilnBOT
#
Channel closed

Closed due to timeout

Use .reopen if this was a mistake.

cedar kilnBOT
#
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.

pastel grove
#

in real life..

cedar kilnBOT
#
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.

#
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.

vague valve
#

In a randomly shuffled 40-card deck, you draw 4 cards at the top to be your starting cards. You have the option to use a mulligan, where you discard a starting card in your hand and redraw another card. Mulligans do not need to be done all at once.

Discarded cards do not go back into the deck, and redrawn cards are drawn from the top of the remaining deck.

The probability of getting a specific hand with mulligans has been determined (#help-13 message), but the likelihood of specific hands that have duplicate cards hasn't been calculated yet.

The deck can consist of 40 identical cards, 1 of 40 different cards, or any combination in between. What’s the chance of drawing a specific hand?

fading jewel
#

"What is the chance you get any specific hand" So you just want 1/total?

#

I don't understand the language of this problem

#

What is a "specific hand" and does the composition of your deck have anything to do with it?

solid juniper
#

this question is too general honestly

fair geyser
#

agreed

fading jewel
#

I think so as well, and the language is weird

solid juniper
#

describe a more specific situation you want to find the probability of

dusky peak
#

Do i understand it correctly that we dont even know the starting deck?

fading jewel
#

"The deck can contain 40 of the same card, 1 of 40 different cards, and everything in between, but for most cases it will be 4x of 12 unique cards."

What does that even mean

#

Yeah we don't know

#

And then "most cases it will be 4x of 12 unique cards"

#

How often is "most cases"

#

How often do other cases occur?

#

It isn't specific enough to be solvable

fair geyser
#

you can only solve a specific problem, so it only make sense to give a specific problem, but they gave the specific example anyway

#

just ignore the rest

fading jewel
#

Ignore what?

#

@vague valve

#

He made the question and then disappeared

vague valve
#

hm

fading jewel
#

Lmao

vague valve
#

sorry i went to do something

fading jewel
# vague valve hm

What is a "specific hand" and what do you mean by "The deck can contain 40 of the same card, 1 of 40 different cards, and everything in between, but for most cases it will be 4x of 12 unique cards."

#

That second statement is too general

vague valve
#

sorry about that

vague valve
#

wdym

fading jewel
fair geyser
#

7 aces, 11 jacks, 3 queens, 16 kings, 3 10s. what is the chance that you'll able to get an ace, jack, and queen in your starting hand, you can redraw any of the 4 initial cards

vague valve
#

yeah

fading jewel
#

In a deck of 40 correct?

vague valve
#

yes

#

it would be nice to have an equation for any deck composition but for a start this makes sense

fading jewel
#

What is the chance you redraw AT LEAST 1?

vague valve
#

nah you have to have all 3 in your starting hand

fading jewel
#

Wait are we not drawing 4 cards?

vague valve
#

we draw 4 cards, and we can redraw any of the drawn cards 1 time each

fading jewel
#

Ok wait I think I get it you have 4 slots for 3 cards

vague valve
#

we want to have king ace jack in our starter hand, it doesnt matter if its KAJK, KAJJ, KAJQ, it just needs king ace jack

fading jewel
#

Probability of the initial draw having all three cards is

(7c1 * 11c1 * 3c1 * 19c1)/(40c4)

#

Do we agree?

solid juniper
fading jewel
#

No?

#

Its a 40 card deck thats why its 40c4

solid juniper
#

i do not agree with this

#

you are overcounting in the numerator

#

because the 37c1 part includes kings aces jacks ace jack queen oops edited, 2 different problems stated but ig we're doing this one

fading jewel
#

40 - 11 - 7 - 3

#

Wait the last one could be another ace king or jack

#

We don't care right?

#

It just has to include at least 1 of each

solid juniper
#

not 100% clear but yea i'd assume that's allowed

#

so still not right if that's the case

fading jewel
#

Then why would it not be 37?

#

If we don't really care what the last card is

solid juniper
#

well we care about not double counting things

fading jewel
#

Sorry if that sounds dumb, havent had to do combinatorics in a long time

solid juniper
#

or in other words, A1 J1 Q1 A2 gets counted twice

cedar kilnBOT
#

@vague valve Has your question been resolved?

vague valve
solid juniper
#

depends how you count them ig. in que's way, you don't want those to be counted as different

cedar kilnBOT
#

@vague valve Has your question been resolved?

muted bear
#

card bartering advanced

cedar kilnBOT
#

@vague valve Has your question been resolved?

cedar kilnBOT
#

@vague valve Has your question been resolved?

cedar kilnBOT
#

@vague valve Has your question been resolved?

unborn cradle
#

yeah

#

we want (40 choose 4) - (combos without ace) U (combos without jack) U (combos without queen)

#

Let
A = set of combos without ace
J = set of combos without jack
Q = set of combos without Q

#

then |AUJUQ| = |A| + |J| + |Q| - |A∩J| - |A∩Q| - |J∩Q| + |A∩J∩Q|

#

and we want (40 choose 4) - |AUJUQ|

#

that's without mulligans, with mulligans it's a bit more complicated.

#

We probably need 3 cases:
drawing 0 of the cards we want, mulligan all 4 cards
drawing 1 of the cards we want, mulligan 3 cards
drawing 2 of the cards we want, mulligan 2 cards

vague valve
#

yeah that would make sense

cedar kilnBOT
#

@vague valve Has your question been resolved?

unborn cradle
#

Drawing 0 of the cards we want is just |A∩J∩Q|

unborn cradle
#

For drawing 1 of the cards we want there are 3 possibilities. Let's start with drawing Ace but not Jack or Queen

#

that's |J∩Q∩(A^c)| where A^c is the complement of A

#

If you think about it, these are all the cases where we don't draw Jack or Queen - all the cases where we don't draw Ace, Jack, or Queen.

#

|J∩Q∩(A^c)| = |J∩Q| - |A∩J∩Q|

#

so if we just draw ace we get:
|J∩Q| - |A∩J∩Q|
if we just draw jack we get:
|A∩Q| - |A∩J∩Q|
if we just draw queen we get:
|A∩J| - |A∩J∩Q|

#

now the only remaining case is drawing two of the cards we want

#

Let's say we draw Ace and Jack but not Queen

#

we have

#

|(A^c)∩(J^c)∩Q|

#

|Q| = |((A^c)∩(J^c))∩Q| + |(AUJ)∩Q|

#

so rearranging we get

|(A^c)∩(J^c)∩Q| = |Q| - |(AUJ)∩Q|

#

then |(AUJ)∩Q| = |A∩Q| + |J∩Q| - |A∩J∩Q|

#

so

#

|(A^c)∩(J^c)∩Q| = |Q| - |A∩Q| - |J∩Q| + |A∩J∩Q|

#

So drawing Ace and Jack but not Queen is:
|Q| - |A∩Q| - |J∩Q| + |A∩J∩Q|
drawing Ace and Queen but not Jack is:
|J| - |A∩J| - |J∩Q| + |A∩J∩Q|
drawing Jack and Queen but not Ace is:
|A| - |A∩J| - |A∩Q| + |A∩J∩Q|

#

then we can use a similar process to calculate the probability of redrawing what we want after the mulligan

unborn cradle
#

@vague valve does that make sense so far?

vague valve
unborn cradle
#

oh it means intersection

#

are you familiar with unions and intersections?

#

The idea is we want to transform all the unions to intersections because the size of the intersections are easy to calculate

#

|A| = ((40 - #aces) choose 4)
|A∩J| = ((40 - #aces - #jacks) choose 4)
|A∩J∩Q| = ((40 - #aces - #jacks - #queens) choose 4)

#

for example

vague valve
#

that makes sense

noble granite
#

If your question has been answered, please type .close to allow other people to use the help channels.

vague valve
#

it hasnt

unborn cradle
#

which part do you still need help with?

vague valve
#

well i haven't seen what the chance is for the example i gave

#

i was hoping for an equation that i could plug numbers into

unborn cradle
#

ok I can show you how to calculate it for that example

vague valve
#

alr

unborn cradle
#

maybe in like 45 minutes I'm working rn

vague valve
#

take your time, you've helped a bunch

unborn cradle
#

ok so this is going to be a really long calculation

#

we want

#

chance of drawing all 3 + chance of drawing 0 * chance of successful mulligan + chance of drawing 1 * chance of successful mulligan + chance of drawing 2 * chance of successful mulligan

#

chance of drawing all 3 = ((40 choose 4) - |AUJUQ|)/(40 choose 4)

#

Let's start with calculating the size of all the intersections

#

|A| = ((40 - 7) choose 4) = 40920
|J| = ((40 - 11) choose 4) = 23751
|Q| = ((40 - 3) choose 4) = 66045
|A∩J| = ((40 - 7 - 11) choose 4) = 7315
|A∩Q| = ((40 - 7 - 3) choose 4) = 27405
|J∩Q| = ((40 - 11 - 3) choose 4) = 14950
|A∩J∩Q| = ((40 - 7 - 11 - 3) choose 4) = 3876
40 choose 4 = 91390

#

so

#

|AUJUQ| = |A| + |J| + |Q| - |A∩J| - |A∩Q| - |J∩Q| + |A∩J∩Q|
= 40920 + 23751 + 66045 - 7315 - 27405 - 14950 + 3876
= 84922

#

chance of drawing all 3 = ((40 choose 4) - |AUJUQ|)/(40 choose 4)
= (91390 - 84922)/91390 = 6468/91390 = 3234/45695 ~ 7.077%

#

chance of drawing 0 is just |A∩J∩Q|/(40 choose 4) = 3876/91390 = 102/2405 ~ 4.241%

#

then chance of a successful mulligan after drawing zero is just the 3234/45695 ~ 7.077% we found previously

#

so we have 102/2405 * 3234/45695 = 329868/109896475 ~ 0.3002%

#

next we do chance of drawing 1 * chance of successful mulligan

#

which is actually 3 separate cases

#

Just Ace = |J∩Q| - |A∩J∩Q| = 14950 - 3876 = 11074
Just Jack = |A∩Q| - |A∩J∩Q| = 27405 - 3876 = 23529
Just Queen = |A∩J| - |A∩J∩Q| = 7315 - 3876 = 3439

#

Then the chances are
11074/91390 = 5537/45695 ~ 12.12%
23529/91390 = ~ 25.75%
3439/91390 = 181/4810 ~ 3.763%

#

respectively

#

now we're going to mulligan 3 cards, so we'll divide by 39 choose 3 instead of 40 choose 4

#

and we have to adjust the calculations for drawing what we want accordingly as well

#

so say we draw just Ace then mulligan 3

#

We want ((39 choose 3) - |J* U Q*|)/(39 choose 3)

#

J* and Q* are modified J and Q since we're only drawing 3 and the pool of cards is different

#

we can use inclusion exclusion again

#

|J* U Q*| = |J*| + |Q*| - |J*∩Q*|

#

|J*| = (39 - 11) choose 3 = 3276
|Q*| = (39 - 3) choose 3 = 7140
|J*∩Q*| = (39 - 11 - 3) choose 3 = 2300

#

so |J* U Q*| = |J*| + |Q*| - |J*∩Q*| = 3276 + 7140 - 2300 = 8116

#

also (39 choose 3) = 9139

#

so ((39 choose 3) - |J* U Q*|)/(39 choose 3)
= (9139 - 8116)/9139 = 1023/9139 ~ 11.19%

#

Now we multiply that by the chance of drawing just Ace:
5537/45695 * 1023/9139 = 5664351/417606605 ~ 1.356%

#

now we have to do the same thing again for just Jack and just Queen lolol

#

are you getting the general idea now at least?

#

I can continue if needed

vague valve
#

yeah i think so lol, its just very complicated

#

honestly i knew it was complex but i didn't think it would be this much, but it does make sense

#

the example i gave isn't very applicable to what im using it for but i was thinking you could figure out the steps for it and then just apply it to the other situations

unborn cradle
#

There might be a way to simplify it, I'm not sure

#

the mulligans are really what makes it complicated

#

It would probably we worth coding a simulation that you can just plug the numbers into

#

calculator, not simulation

#

though a simulation might give a good approximation

vague valve
unborn cradle
#

not neccessarily, is it always a 3 card combo?

vague valve
#

nah, it could be 1 2 3 or 4

#

although 4/1 seem easier to calculate

#

for the majority of cases it'll be a 2/3 card combo, and 4 of them in the deck per card. theres always 40 cards in the deck though

cedar kilnBOT
#

@vague valve Has your question been resolved?

vague valve
#

@unborn cradle are you here?