Techie's not going to be happy with me because we spent 3 hours on this last night. But essentially, we want to find the probability that nC7 is divisible by 12. So, we found the probability that 2^6 is a factor and 3^3 is a factor (i'm good on that now). We then multiplied the two together, assuming independence. How did we know it was independent? How can we show it? I tried to find one given the other but struggled. The other thing I can do is find the union of the two events and use the inclusion/exclusion principle, but I do not know how to find the union of events without the intersection (which is what we are looking for). Any suggestions?
#Revisiting Complicated Probability Problem
97 messages · Page 1 of 1 (latest)
- Do not ping the Moderators, unless someone is breaking the rules.
- Do not ping the Helper Moderators, unless there is a conflict between helpers.
- Do not ping other members randomly for help.
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- If the Helper has answered your question, remember to thank them with the Mathematics Ranks bot and close the thread with:
+close
Feel free to nominate the person for helper of the week in #helper-nominations
If you're happy with the help you got here, and the server overall, you can contribute financially as well:
ndependence of which events?
We know they're independent because factors of 3 and factors of 4 have nothing to do with one another. How many numbers are multiples of 3?
independence of being a multiple of 2^6 and of being a multiple of 3^3
1/3 of numbers. I guess that there are just some times when intuitiveness doesn't seem to work to determine independence. I'd like to somehow mathematically justify it
So out of all the natural numbers, every third is a multiple of 3, correct?
correct
So now multiply all the natural numbers by 4.
Has that changed their divisibility by 3?
Therefore, every third multiple of four is a multiple of three.
i concur.
some food for thought:
think modulo 9
n choose 7 is divisible by 3 with probability 7/9
Which is exactly the same distribution over the natural numbers generally, hence independence.
how did you get that so fast???
it took a modified tree diagram for me to see
but the question is given 7 consecutive numbers, which certain combinations of powers of 2 and powers of 3 aren't possible
how do we know this? sorry, I haven't taken number theory
...the point was to demonstrate independence of divisibility by 3 and divisibility by 4.
thinking... not ignoring you
i think i'm starting to see what you're saying. because n choose 7 is, at the end of the day, just a number. And the chance of any number being divisible by 3/by 4 are independent. I guess what's holding me up is that nC7 is not any number, it is specifically the product of 7 consecutive numbers
if you want some intuitive rationale for this think of the fundamental theorem of arithmetic
whether or not you choose a power of 2 as a factor does not depend on whether you choose some other power of another prime as a factor
It's not actually the product of 7 consecutive numbers.
It's that product divided by 7!.
oooooooohhhhh very true
but still we aren't guaranteed to get every possible natural number, right? so we're still lookin at a special form
Again, the point at issue is the independence of divisibility by 3 and divisibility by 4.
Maybe we're thinking of two separate events? I'm looking at the events:
The product of 7 consecutive natural numbers divided by 7! is divisibly by 2^6
and
The product of 7 consecutive natural numbers divided by 7! is divisibly by 3^3
What Im understanding from you is that you are looking at the events
a natural number is divisible by 3
a natural number is divisible by 4
I guess I just feel like my events have an extra layer of conditions
No, you're not.
a number is divisible by 12 if and only if it is divisible by both 3 and 4, this what you should be honed in on
You've confused yourself again about whether you're looking at the choice function or the permutation function.
I was going to try to simplify the problem in my head to show you what i was thinking, but that demonstrated independence. i'll try to sketch something out to show you my concerns
im still interested in this. i think something like this could be helpful for me
I don't see how, considering you're confused specifically about independence.
yes and also n choose 7 is divisible by 4 iff it's not 7,11 or 15 modulo 16
indepndence really is a small issue here
your core task is to figure out the proportions
No, that part was already done. This really is just about independence. Which also isn't a "small issue" considering it determines how we combine the proportions to achieve our final answer.
Ok, I have my picture that i sketched (the diagram is from yesterday)
*multiples, not factors
like if that 2l is also 4l, doesn't the probability that the term on either side of it is 3 to a power change?
No.
So the probability that 4k is next to 3^3 and the probability of 4k is next to 3^6 is the same?
yeah i think that once again that is the problem for me. how did we come up with this statement? if i can come up with a formulaic way to do this kind of stuff it might be helpful
oh wow, I'd forgotten what a rabbit hole this independence business was
Stop worrying about cubes.
and if we could come up with expressions like this easily, can we come up for an expression divisible by 12 that easy?
you are correct, it's a highly nontrivial problem if done properly
yeah. maybe i'm thinking too much into the definition. We know that events are independent if P(AB) = P(A|B)P(B)
No.
that is conditional probability
That part is always true.
again we haven't yet learned about independence which is part of the issue
Events A and B are independent if and only if P(A|B) = P(A).
Ah, that's it thanks
i recommend you drop it then
there is no world in which you are expected to provide actual proof for the independence of divisibility by different primes
So i wanted to show that P(A|B) = P(A) to show that they're independent
oh really? it's just kind of assumed?
Which is what I just proved to you right at the beginning.
be content with the heuristic argument
that's asking a lot haha. i got into math so i can learn the reasonings behind the heuristic argument
and you also said you haven't learned that much about probability theory
Well, in my mind, we were looking at two different events, which I still don't see how they relate
this is hw
prof gave the hint to use inclusion/exclusion property. we tried that yesterday and coudlnt figure it out
Because. If. A. Number. Is. Divisible. By. 3. That. Doesn't. Affect. Whether. Or. Not. It. Is. Divisible. By. 4.
i think we're miscommunicating. ill go to my ta's office hours tomorrow. thanks for trying
What i was trying to argue is that only works for all natural numbers. If I say what is the probability that a number of the form y=2n+2 is divisible by 6, that (if im calculating correctly) is different than the probability that any integer is divisible by 6
No, it doesn't work for "all real numbers". The probability that any given real number is divisible by any integer is 0.
fixed it
That's because 2n + 2 is always divisible by 2, and hence the probability that it's divisible by 6 hinges on whether it's divisible by 3, which is independent of its divisibility by 2.
We're not saying that the probability that nC7 is divisible by 4 is 1/4, only that the event that nC7 is divisible by 4 is independent of the event that it's divisible by 3.
In fact, we already know what the probability is that nC7 is divisible by 3 or 4.
12 is composite, so probably not, but it doesn't matter because it suffices to determine when we have divisibility by 3 and 4

I'll just go to office hours tomorrow. Thanks. I googled it and 2 events being independent in one sample space does not guarantee that 2 events are independent in a different sample space. So i'll have to clarify how we know they are independent when the sample space is not the natural numbers
+close
Please thank your Helpers before closing!
Please thank the helpers who assisted you by clicking the buttons below. You can thank each helper only once. Once you're done, click "Close Post" to close this thread.
Thank you for your feedback! Techie Literate has been awarded 1
. They now have 913
. They have 2
daily left for today.
Thank you for your feedback! aL has been awarded 1
. They now have 849
. They have 3
daily left for today.
Thank you for your feedback! coffey has been awarded 1
. They now have 38
. They have 3
daily left for today.
:closed: | Help Request Closed
This post has been closed and archived. Thank you for using our help system!
lmao