lai lai sgtalkers, can you solve this simply maths prob?
25-05-2024, 11:00 PM
25-05-2024, 11:12 PM
simple meh? wah low i count manually until give up
26-05-2024, 12:35 AM
ask chatGPT AI
26-05-2024, 01:08 AM
I ask liao, it stunned like vegetable gave no answer
26-05-2024, 01:19 AM
It’s all 7 steps.
26-05-2024, 01:39 AM
26-05-2024, 02:57 AM
a. C(7, 3) or c(7, 4) = 35
b. C(4, 2) x c(3, 1) or c(3, 2) = 6 x 3 = 18
There're several ways to solve it, but the combination method is the easiest
b. C(4, 2) x c(3, 1) or c(3, 2) = 6 x 3 = 18
There're several ways to solve it, but the combination method is the easiest
26-05-2024, 08:34 AM
No matter how you go or move, using the shortest route, it will still take 7 streets to reach from A to B. Likewise even passing by C.
26-05-2024, 09:22 AM
This is similar to traveling salesman problem in classical AI, to find the optimal routs between 2 cities or among several cities
26-05-2024, 12:06 PM
26-05-2024, 02:20 PM
26-05-2024, 02:21 PM
26-05-2024, 02:47 PM
(26-05-2024, 02:20 PM)pinkypanther Wrote: Huh what is all that c(7,3) c(7,4) stuff?
Draw a straight line from A to B, that's the shortest path, and it covers an area of 4x3 rectangles.
The total numbers of routes is therefore same as choosing 4 horizontal paths out of 7, combination of 4 out of 7, c(7, 4), or 3 vertical ones from 7, c(7, 3)
C(7, 4) = c(7, 3) = 7!/4!/3! = 7*6*5*4*3*2/4*3*2/3*2 = 35
26-05-2024, 03:42 PM
(26-05-2024, 02:21 PM)Alleggsinonebasket Wrote: Detailed full solutionNice clear explanation thanks
https://www.domainofexperts.com/2024/05/...lysis.html
« Next Oldest | Next Newest »
Users browsing this thread: 1 Guest(s)