At the local model boat club, four friends were talking about their boats.

There were a total of eight boats, two in each colour, red, green, blue and yellow. Each friend owned two boats.

No friend had two boats of the same colour.
Alan didn't have a yellow boat. Brian didn't have a red boat, but did have a green one.

One of the friends had a yellow boat and a blue boat and another friend had a green boat and a blue boat. Charles had a yellow boat. Darren had a blue boat, but didn't have a green one.

Can you work out which friend had which coloured boats?

KingEbukasBlog:

14

Explain

annnikky:
At the local model boat club, four friends were talking about their boats.

There were a total of eight boats, two in each colour, red, green, blue and yellow. Each friend owned two boats.

No friend had two boats of the same colour.
Alan didn't have a yellow boat. Brian didn't have a red boat, but did have a green one.

One of the friends had a yellow boat and a blue boat and another friend had a green boat and a blue boat. Charles had a yellow boat. Darren had a blue boat, but didn't have a green one.

Can you work out which friend had which coloured boats?

Charles - yellow boat and a red boat.
Darren - blue boat and a yellow boat.
Alan - red boat and a green boat.
Brian - green boat and a blue boat.

4kings:

Charles - yellow boat and a red boat.
Darren - blue boat and a yellow boat.
Alan - red boat and a green boat.
Brian - green boat and a blue boat.

Hmmmmm... Not correct
Try again 4kings

4kings:

Explain

Trial and error

annnikky:
At the local model boat club, four friends were talking about their boats.

There were a total of eight boats, two in each colour, red, green, blue and yellow. Each friend owned two boats.

No friend had two boats of the same colour.
Alan didn't have a yellow boat. Brian didn't have a red boat, but did have a green one.

One of the friends had a yellow boat and a blue boat and another friend had a green boat and a blue boat. Charles had a yellow boat. Darren had a blue boat, but didn't have a green one.

Can you work out which friend had which coloured boats?

No boat rr , , bb , yy
Let red be r , blue = b , green = g , yellow=y
Possible combinations = rg , rb , ry , gb , gy , by

Alan = rg
Brian = gb
Charles = ry
Darren = by

KingEbukasBlog:


No boat rr , , bb , yy
Let red be r , blue = b , green = g , yellow=y
Possible combinations = rg , rb , ry , gb , gy , by

Alan = rg
Brian = gb
Charles = ry
Darren = by

Wrong... Try again

annnikky:

Wrong... Try again

How na ? Even 4king's and mine are the same

KingEbukasBlog:


How na ? Even 4king's and mine are the same

Ok lemme paste d sol.

Sol.

Allan-->Red and green
Brian-->Green and yellow
Charles-->Yellow and Blue
Darren---->Blue and Red

annnikky:
Sol.

Allan-->Red and green
Brian-->Green and yellow
Charles-->Yellow and Blue
Darren---->Blue and Red

Its correct too . That's why I listed possible combinations .

You are the ruler of a medieval empire and you are about to have a celebration tomorrow. The celebration is the most important party you have ever hosted. You've got 1000 bottles of wine you were planning to open for the celebration, but you find out that one of them is poisoned.

The poison exhibits no symptoms until death. Death occurs within ten to twenty hours after consuming even the minutest amount of poison.

You have over a thousand slaves at your disposal and just under 24 hours to determine which single bottle is
poisoned.

You have a handful of prisoners about to be executed, and it would mar your celebration to have anyone else killed.

What is the smallest number of prisoners you must have to drink from the bottles to be absolutely sure to find the poisoned bottle within 24 hours?

KingEbukasBlog:


Its correct too . That's why I listed possible combinations .

Cross check it very well then u'll find out

annnikky:
You are the ruler of a medieval empire and you are about to have a celebration tomorrow. The celebration is the most important party you have ever hosted. You've got 1000 bottles of wine you were planning to open for the celebration, but you find out that one of them is poisoned.

The poison exhibits no symptoms until death. Death occurs within ten to twenty hours after consuming even the minutest amount of poison.

You have over a thousand slaves at your disposal and just under 24 hours to determine which single bottle is
poisoned.

You have a handful of prisoners about to be executed, and it would mar your celebration to have anyone else killed.

What is the smallest number of prisoners you must have to drink from the bottles to be absolutely sure to find the poisoned bottle within 24 hours?

No idea .

KingEbukasBlog:



No idea .

U sure

annnikky:

U sure

Well I'm not sure

1000 bottles , 10 hours at least to die .

If you arrange these bottles in 10 straight lines containing 100 bottles with 10 slaves . Each of the ten slaves will be labelled from A-J . Every bottle in a particular line will have to be labelled a particular alphabet (from A to J) . Each slave will stand on the line of the same alphabet and have a taste from a 100 bottles .

After 10 hours , if a slave dies , then from his label we can have the particular line where the poisoned wine is .Another slave is added to the 9 alive to make another 10 slaves with new labels this time (from K to T) and each bottle from that line where the first slave died will have K to T

Then each slave should be asked to stand in front of the bottle that bears his label and asked to taste the wine . They'll wait for another 10 hours to see who dies and what label he bears . Of course , it would be found .

So the least number of slaves is 11 .

KingEbukasBlog:


Well I'm not sure

1000 bottles , 10 hours at least to die .

If you arrange these bottles in 10 straight lines containing 100 bottles with 10 slaves . Each of the ten slaves will be labelled from A-J . Every bottle in a particular line will have to be labelled a particular alphabet (from A to J) . Each slave will stand on the line of the same alphabet and have a taste from a 100 bottles .

After 10 hours , if a slave dies , then from his label we can have the particular line where the poisoned wine is .Another slave is added to the 9 alive to make another 10 slaves with new labels this time (from K to T) and each bottle from that line where the first slave died will have K to T

Then each slave should be asked to stand in front of the bottle that bears his label and asked to taste the wine . They'll wait for another 10 hours to see who dies and what label he bears . Of course , it would be found .

So the least number of slaves is 11 .

U really tried



Solution

10 prisoners must sample the wine. Bonus points if
you worked out a way to ensure than no more
than 8 prisoners die.

Number all bottles using binary digits. Assign
each prisoner to one of the binary flags.
Prisoners must take a sip from each bottle
where their binary flag is set.
Here is how you would find one poisoned bottle
out of eight total bottles of wine.

Bottle 1 Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle
6 Bottle 7 Bottle 8
Prisoner A X X X X
Prisoner B X X X X
Prisoner C X X X X
In the above example, if all prisoners die, bottle
8 is bad. If none die, bottle 1 is bad. If A & B
dies, bottle 4 is bad.
With ten people there are 1024 unique
combinations so you could test up to 1024
bottles of wine.

Each of the ten prisoners will take a small sip
from about 500 bottles. Each sip should take no
longer than 30 seconds and should be a very
small amount. Small sips not only leave more
wine for guests. Small sips also avoid death by
alcohol poisoning. As long as each prisoner is
administered about a millilitre from each bottle,
they will only consume the equivalent of about
one bottle of wine each.

Each prisoner will have at least a fifty percent
chance of living. There is only one binary
combination where all prisoners must sip from
the wine. If there are ten prisoners then there
are ten more combinations where all but one
prisoner must sip from the wine. By avoiding
these two types of combinations you can ensure
no more than 8 prisoners die.

Four people need to cross a rickety bridge at night.
Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge.

Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?

annnikky:




U really tried

Thanks

Solution

10 prisoners must sample the wine. Bonus points if
you worked out a way to ensure than no more
than 8 prisoners die.

Number all bottles using binary digits. Assign
each prisoner to one of the binary flags.
Prisoners must take a sip from each bottle
where their binary flag is set.
Here is how you would find one poisoned bottle
out of eight total bottles of wine.

Bottle 1 Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle
6 Bottle 7 Bottle 8
Prisoner A X X X X
Prisoner B X X X X
Prisoner C X X X X
In the above example, if all prisoners die, bottle
8 is bad. If none die, bottle 1 is bad. If A & B
dies, bottle 4 is bad.
With ten people there are 1024 unique
combinations so you could test up to 1024
bottles of wine.

Each of the ten prisoners will take a small sip
from about 500 bottles. Each sip should take no
longer than 30 seconds and should be a very
small amount. Small sips not only leave more
wine for guests. Small sips also avoid death by
alcohol poisoning. As long as each prisoner is
administered about a millilitre from each bottle,
they will only consume the equivalent of about
one bottle of wine each.

Each prisoner will have at least a fifty percent
chance of living. There is only one binary
combination where all prisoners must sip from
the wine. If there are ten prisoners then there
are ten more combinations where all but one
prisoner must sip from the wine. By avoiding
these two types of combinations you can ensure
no more than 8 prisoners die.

Wow ! Now this is one heck of a solution . Its more complicated though .

Anyway , the next one please

annnikky:
Four people need to cross a rickety bridge at night.
Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge.

Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?

Persons A =1 , B= 2 , C=7 , D=10

AB cross with the torch first = 2 minutes ( the latest time)

B stays at the other end while A gets to C with the torch = 1 minute
Hands the torch to C and D and waits

Time taken after first round 2 + 1 = 3 minutes = T1

CD cross with the torch = 10minutes ( latest time) = T2

CD stay at the other end as B goes with the torch to get A = 2 minutes

AB and now return with the torch = 2 minutes(latest time)
Total time for this round = 2 + 2 = 4 minutes = T3

Total time taken = T1 + T2 + T3 = 3 + 10 + 4 = 17 minutes

KingEbukasBlog:


Thanks





Wow ! Now this is one heck of a solution . Its more complicated though .

Anyway , the next one please

U wlcm

KingEbukasBlog:


Persons A , B , C , D

AB cross with the torch first = 2 minutes ( the latest time)

B stays at the other end while A gets to C with the torch = 1 minute

Time taken after first round 2 + 1 = 3 minutes = T1

AC cross with the torch = 7 minutes ( latest time)
C stays at the other end with B while A gets to D with torch = 1 minute

Time taken after second round = 7 + 1 = 8 minutes = T2

AD cross with the torch = 10 minutes (latest time) = T3

Total time taken = T1 + T2 + T3 = 3 + 8 + 10 = 21 minutes

U tried buh u didn't get it

annnikky:

U tried buh u didn't get it

I just modified it . It says shortest time . I discovered a shorter time . Please check it out

KingEbukasBlog:


I just modified it . It says shortest time . I discovered a shorter time . Please check it out

Ok

KingEbukasBlog:


Persons A =1 , B= 2 , C=7 , D=10

AB cross with the torch first = 2 minutes ( the latest time)

B stays at the other end while A gets to C with the torch = 1 minute
Hands the torch to C and D and waits

Time taken after first round 2 + 1 = 3 minutes = T1

CD cross with the torch = 10minutes ( latest time) = T2

CD stay at the other end as B goes with the torch to get A = 2 minutes

AB and now return with the torch = 2 minutes(latest time)
Total time for this round = 2 + 2 = 4 minutes = T3

Total time taken = T1 + T2 + T3 = 3 + 10 + 4 = 17 minutes

Yeeeeaaaahhhhhhh

annnikky:

Yeeeeaaaahhhhhhh

yes !!!



Cos I was like the 7 and 10 minutes guys can go together to save time .

Sherlock, A detective who was mere days from cracking an international smuggling ring has suddenly gone missing.

While inspecting his last-known location, you find a note:
710 57735 34 5508 51 7718
Currently there are 3 suspects: Bill, John, and Todd. Can
you break the detective's code and find the criminal's
name?

KingEbukasBlog:


yes !!!



Cos I was like the 7 and 10 minutes guys can go together to save time .

Ok bravo

annnikky:
Sherlock, A detective who was mere days from cracking an international smuggling ring has suddenly gone missing.

While inspecting his last-known location, you find a note:
710 57735 34 5508 51 7718
Currently there are 3 suspects: Bill, John, and Todd. Can
you break the detective's code and find the criminal's
name?

I've tried binary numbers , I've looked for the corresponding number in the alphabets , nothing coherent . Does it have it do with longitude and latitude or some kind of international phone codes like Nigeria is 234 , something like that ?

Sorry I just need a hint

KingEbukasBlog:


I've tried binary numbers , I've looked for the corresponding number in the alphabets , nothing coherent . Does it have it do with longitude and latitude or some kind of international phone codes like Nigeria is 234 , something like that ?

Sorry I just need a hint

Is a logical thinking

annnikky:

Is a logical thinking

Well , I dont think I know this one - final answer .

Please help me with the solution

KingEbukasBlog:


Well , I dont think I know this one - final answer .

Please help me with the solution

Hahahahaha ok