Problem #PRU-88003

Problems Discrete Mathematics Set theory and logic Mathematical logic Mathematical logic (other)

Problem

There are five chain links with 3 rings in each. What is the smallest number of rings that need to be unhooked and hooked together to connect these links into one chain?