Maths problem

[1fast1]

57 minutes ago, Vid said:

You sibei smart... although I have no idea what everything is 🤣🤣

Let me try to digest some of them too. 😁

LOL no lah... this one looks complicated because it's written out quite rigorously. 

If I explain on a whiteboard or blackboard (Khan Academy style) it would be much easier. 😁

[Ray7456]

Would like to tap on the experts here though this is a science question. A little explanation to the answer would help too. Thanks in advance

[1fast1]

19 minutes ago, Ray7456 said:

Would like to tap on the experts here though this is a science question. A little explanation to the answer would help too. Thanks in advance

In a sense, all physics is applied math. 

This is essentially very elementary graph theory if you think of the points as nodes and the wire segments as edges so it's definitely math.

The circuit tester just tells you if a connected path exists between two nodes. 

Doesn't matter how many nodes in the middle, a path exists as long as you can travel from one node to the other via wires.

So:

Linked are:

A to F. 

C to F. 

Unlinked are:

A to B

B to D

C to E

Only (4) satisfies all. 

(1) fails because A is not linked at all. 

(2) fails because B and D are linked (through C but that doesn't matter). 

(3) fails because C and E are linked. 

So all violate one or more of the conditions. 

The only one that doesn't violate any is (4), and that's the answer.

 

 

[Ray7456]

Thanks TF4 appreciate that 👍