A few days ago
ME!!!

Maths problem?

Im just wondering f there’s a formula that I have to use to solve this maths sum: There are 100 soldiers in a detachment and every evening 3 of them are on duty. Can it happen that after a certain period of time each soldier has shared duty with every other soldier exactly once?

Top 7 Answers
A few days ago
e.giannelos

Favorite Answer

100 evenings
0

A few days ago
morwood_leyland
This is Permutation theory – you are being asked the number of unique combinations of 3 from a population of 100. “Unique” means that “abc” is counted the same as “bca”. If this is not so then you use Combination Theory.

You use what is called the factorial if a number – written (for the number 3) as 3! The value is the number multiplied by every integer below it = 3x2x1 = 6 for “3!”. Excel has a function fact(x) to do this

The number of Permutations of x soldiers in a froup of N soldiers is N!/(x!)(N-x)! or 100!/(3! x 97!) – work it out.

If the order is important such as they take it in turns to be in charge and you want the number of patrols with unique patrol leaders then the formula is N!/(N-x)! or 100!/97!

0

A few days ago
showentell
IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII one hundred

III three at a time

Unless the hundred lose their place in line it will never happen in a strait line.

This is the same as a combination lock. Only you have a hundred numbers and 3 possible combinations. I think that has 30000 possibilities. I am not sure though it may be 3000.

To solve this you will need to take one guy and concentrate on him and get everyone with him, then move on to the next guy, so every guy will have to share 50 nights on watch so the hundred would be times 50 giving you 500 possible nights on watch.

0

A few days ago
leyenda_asturias
Of course not.
0

A few days ago
pop
figure it out yourself
0

A few days ago
Anonymous
no what are you lazy
0

A few days ago
Anonymous
no
1