Math mini-contest problem for Day 6 on D.Buzz for March 2021 😎
Math problem for Day 6 for March 2021 😎
In a D.Buzz gathering, 32 seats have been prepared such that there are 4 rows and 8 columns. How many ways can Turner and Vision be seated such that they are not adjacent to each other horizontally, vertically, and diagonally?
0
0
0.000
402 is my answer. Work below.
32(31) = 992 = total possibilities
Chance that they are adjacent
992-12-80-96 = 804
Since A and B or B and A are the same, 804/2 = 402 ways.
804
I agree with @jang003's calculation except the division by two at the end. Turner and Vision are different people and therefore exchanging seats for the same chairs is a different way of seating them.
Posted via D.Buzz
brute force approach :D
Congratulations @savvyplayer! You have completed the following achievement on the Hive blockchain and have been rewarded with new badge(s) :
Your next target is to reach 3000 replies.
You can view your badges on your board and compare yourself to others in the Ranking
If you no longer want to receive notifications, reply to this comment with the word
STOP
Check out the last post from @hivebuzz:
Answer for Day 6 Math Problem
Solution
For simplicity in explaining this solution, we assume that Turner and Vision are seated one after the other (in this case, Turner then Vision).
There are 32 ways Turner can be seated.
With the information above, we can get the following:
There are 112 + 416 + 276 = 804 ways Turner and Vision can sit without being adjacent with each other.
Winner: @minus-pi 🏅
1 HIVE has been sent to @minus-pi's Hive account. 💰
Mentions: @holovision, @eturnerx (@eturnerx-dbuzz), @ahmadmanga (@ahmadmangazap), @paultactico2, @appukuttan66, and @dkmathstats 🤓
Special mentions: @dbuzz, @chrisrice, @jancharlest, and @mehmetfix 🤯
Thanks, @savvyplayer!
Congratulations on the 2750 replies! :)
Posted via D.Buzz
Thanks! 🙂
However, I am sad to know that I missed a "Weekly Author" award, because I forgot to post at least once a day. 🙁 I am really so focused on comments. 😅