Connecticut as a permutation, 1 example would be c1,o,n1,n2,e,c2,t1,I,c3,u,t2. 10 items can form 10! permutations. Considering c1=c2=c3, n1=n2, t1=t2, let’s look at the c all equal condition: 3cs existing one in front of or behind another may form c1, c2, c3; c1, c3, c2; c2,c1,c3… totally 6 different ôkkkiojobvarieties
N= night c= child sandy= $10+$5c kimmi= $25n if sandy babysits 3 children for one night they will both be the same price sandy= $10+5(3)=$25 kimmi= $25
To check if distances can be a triangle add the smaller two distances together. If the sum is larger (not equal to) than the longest distance then it is a possible side. For example, 2,2,4 or 1,2,5cannot be a triangle, 2,3, 4 can be a triangle because 2+3 is greater than 4.
