Show that an n-ary relation with a primary key can be
Chapter 12, Problem 30E(choose chapter or problem)
Problem 30E
Show that an n-ary relation with a primary key can be thought of as the graph of a function that maps values of the primary key to (n – l)-tuples formed from values of the other domains.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer