Given n objects arranged in a row, a subset of these objects is called unfriendly if no two of its elements are consecutive. Show that the number of unfriendly subsets each having k elements is

answer: 4

step-by-step explanation:

i wish i could u

step-by-step explanation:

i wish i could u

"image"

step-by-step explanation:

in most of these problems, the notation is that the point with a "prime" is the image of the point without. that is, b' is the image of b.

here, there is no dilation or reflection. there is simply translation (with no direction shown). which figure you call the "preimage" and which one you call the "image" is up to you. as a matter of convention, the naming is as described above.