SOLUTION: If each nerf has at least two squiggles and each squiggle is on at least two nerfs then if there is at least one squiggle, the smallest number of nerfs possible is:
(a) 1 (b) 2
Algebra ->
Customizable Word Problem Solvers
-> Misc
-> SOLUTION: If each nerf has at least two squiggles and each squiggle is on at least two nerfs then if there is at least one squiggle, the smallest number of nerfs possible is:
(a) 1 (b) 2
Log On
Question 287622: If each nerf has at least two squiggles and each squiggle is on at least two nerfs then if there is at least one squiggle, the smallest number of nerfs possible is:
(a) 1 (b) 2 (c) 3 (d) 4 (e) None of the above Answer by richwmiller(17219) (Show Source):
You can put this solution on YOUR website! We are told that there are at least 2 nerfs with one squiggle.
"each squiggle is on at least two nerfs"
There is no reason to think there are more than two nerfs.
(b) 2
