Question 3115: Composition Value from Finite Function Tables

Original question and givens

The explicit total functions have A={2, 3, 4}, B={-16, 0, 17}, C={-29, 0, 32}, f=[(2, 17), (3, -16), (4, 0)], and g=[(-16, 32), (0, 0), (17, -29)]. Find (g∘f)(4).

• G001 — The explicit total functions have A={2, 3, 4}, B={-16, 0, 17}, C={-29, 0, 32}, f=[(2, 17), (3, -16), (4, 0)], and g=[(-16, 32), (0, 0), (17, -29)]. Find (g∘f)(4).

Definition and scope

Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.

• mko-composition

Step-by-step derivation

(g∘f)(x)

g(f(x)):apply f first,then g

f:A→B;g:D→C;D={-16, 0, 17}

both tables are total on their declared domains

x=2;f(x)=17;D={-16, 0, 17}

f(x)∈D=Yes

x=3;f(x)=-16;D={-16, 0, 17}

f(x)∈D=Yes

x=4;f(x)=0;D={-16, 0, 17}

f(x)∈D=Yes

x=4∈A;f(4)=0∈D

g(0)=0∈C

Reverse checks

• S006 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
• S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.

Result

0

The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.

This question review and source binding

Review date: 2026-10-26

Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.