You have the graph of y=∣x∣y = |x| and decide to make another graph, for a function z,z, where you randomly do a horizontal translation of yy of size −1,0,-1, 0, or 1,1, and then randomly do a vertical translation of size −1,0,-1, 0, or 1.1. What is the probability that the graphs of yy and zz intersect at least once?

Choose one answer

Type a concept, like “slope” or “photosynthesis”.

↑ ↓ to choose · Enter to openSearch explanations and problems