Herm and his 12 followers have created a not-so-secret ``handshake'' that involves three people. the first person (the hook) initiates the greeting by casting an invisible fishing line, and the second person (the bait) walks toward the first person as if the ``bait'' is being reeled via the invisible fishing line. when the bait is about to meet the hook, they both go up with hand as if to perform a ``high five.'' at that point, however, a third person (the bandit) steps in to ``steal'' the ``high five'' from the hook. within herm's group, how many different handshakes are possible?

The number of people in this problem is 13, herm and his 12 followers. The secret handshake involve three different roles, so the order of member is important. Every member only able to do 1 roles for every handshake. The number of possible ways for the handshake would be:

13!/(13-3)!= 13*12*11= 1716 ways

grab rope, tie a loop-de-loop, put it around ur neck, now jump while its tied to a high place. now your shoes are cool.

step-by-step explanation:

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol