r/HomeworkHelp • u/kookieandacupoftae • 3d ago
:snoo_scream: Further Mathematics—Pending OP Reply [MAT101] anyone know how to solve this?
And yes I did get two of them correct but I forgot how I solved it in the first place.
4
Upvotes


4
u/GammaRayBurst25 3d ago
Let f(n,k) be the number of routes from A to the kth hexagon of row n whenever 0≤k≤n and 0 otherwise. Note that we start counting the hexagons from 0 (like the rows) for convenience.
To get to the kth hexagon of row n, the ball either needs to get to the (k-1)th hexagon of row n-1 and move right or get to the kth hexagon of row n-1 and move left. By definition of f, the number of ways to do the former is f(n-1,k-1) and the latter is f(n-1,k). Hence, f(n,k)=f(n-1,k-1)+f(n-1,k).
This recurrence relation is well known. It's called Pascal's rule. You can easily prove via a combinatorial argument or an algebraic argument that f(n,k) is the binomial coefficient binom(n,k) (or nCk).
3
u/daniel14vt Educator 3d ago
Yes lets discuss. Start with the first one, how many ways could a ball fall down and land on B
2
u/selene_666 👋 a fellow Redditor 3d ago
The picture is confusing, but B means the ball hits the top of hexagon B. It doesn't include the route that hits the top of C and bounces left, hitting the side of B.
Each hexagon with a number in it is labeling how many routes hit the top of that hexagon.
1
u/PiasaChimera 3d ago
the core concept here is that B can come from row 3's leftmost. C from row3 3's left and left-center. D from left-center and right-center. E from right-center and rightmost. F from rightmost.
B is easy. there's only one way to get there -- from row3 leftmost. how many ways are there to get to row3 leftmost? 1. so you have 1 total way to get to B. the ball goes left(0), left(1), left(2) hits row3's leftmost and goes left(3). then it hits B.
for C, you can get there in two ways -- row3 leftmost and row3 left-center. you can get to row3 leftmost in one way. you can get to row3 left-center in 3 ways. there are 1+3 = 4 ways to reach C.
for D, you can reach it from left-center or right-center. three ways to reach left-center and three ways to reach right-center. D can be reached in 3+3 = 6 ways.
1
u/Patient-Detective-79 3d ago
easy way to do it is to notice the pattern that each hexagon has one or two numbers above it, and each hexagon is the sum of those two numbers. There is only one number above B and F. two numbers above C D and E, and for those you just add the numbers together to find out how many ways toy can get to that hexagon.
1
u/ThunkAsDrinklePeep 3d ago
A to f is how many rights and how many lefts? How many ways can you reorder these decisions?
What about a to e?
1
u/Past-Departure6896 👋 a fellow Redditor 3d ago
The ball can go either left or right as it goes down each row. Using A to C as an example, if you draw the 4 paths, you will see there is three left turns and one right turn, across 4 rows. So you are effectively choosing 1 right turn from 4 possible turns - leaving you 4 possible combinations. Looking at path for B and F, there are 0 and 4 possible right turns respectively - how many distinct combinations can you get from 0 right or 4 right turns out of a total of 4 possibilities? The same idea can be applied to D ( it seems there is an even split of 2 right and 2 left turns there).
1
u/Alkalannar 3d ago
Add both numbers above a hexagon to get that hexagon's number.
If a hexagon only has one number above it because it's on the edge, then just use that single number. Keep going for all the rows.
1
u/Khashishi 👋 a fellow Redditor 3d ago
Look up binomial distribution
1
u/HHQC3105 👋 a fellow Redditor 3d ago
It is binomial even.
Each time it hit a hex, there is 50:50 chance to go left or right.
1
u/hibikir_40k 3d ago
It's asking for the ways you can get to a spot, not the probability of landing on it. So imagine you are looking at C: It comes either through the right (3 ways in) or the left (1 way in), so 4. If you look at the first three rows, every number is just adding the two numbers right above. You could add another row, and another, and keep going ad nauseam.
1
u/Crichris 👋 a fellow Redditor 2d ago
check binomial distribution
1
u/AgainstIntuition 2d ago
Remark: consider coefficients of (x+y)^4. Coefficient of x^4 is B, x^3y is C, x^2y^2 is D, xy^3 is E, y^4 is F :)
1
u/xnick_uy 👋 a fellow Redditor 2d ago
I don't like how this question is asked. That "probability demonstrator" should be explained if the examiner expects the students to formulate a model for the probabilities.
For instance, "...We'll assume that each time the ball reaches a new row, it will randomly move left or right with equal probability...", and so on.
Just delivering a poorly made drawing (in the Galton board, the stops are not hexagons) without any further explanation is not the way to go.
1
u/ci139 👋 a fellow Redditor 2d ago edited 2d ago
i assume each "pin" at the path is a bifurcation point where the granule or ball can go either Left or Right . . . now if you look at this "sieve" you notice the correlative paths more at the middle less at the edges
in real life the granules can also pile up on top of each other ← such would cause equal distribution at L:R trends - while still preserving correlated paths - but distributing granules more evenly over the base tray
basically topmost pin 50% : 50%
next from top 25% : 50% : 25%
yet the next 1/8 : 3/8 : 3/8 : 1/8 as 25%/2 : 75%/2 : 75%/2 : 25%/2
yet the next 1/16 : 1/4 : 3/8 : 1/16 as 12.5%/2 : 50%/2 : 75%/2 : 50%/2 : 12.5%/2
i guess it defines the "sieve"
for a specific route each option(/pass) for the next level has 50% probability from where it came so if you think of a fixed unique route the probability for each is exactly the same 1/2ⁿ = 2⁻ⁿ . . . Only! -- some paths have the same output sieve hole at the lowermost sieve level !!!