Explore related knowledge and questions →

Question 6973: True Fraction Sum versus Naive Representation Addition

On this page
  1. Original question and givens
  2. Definition and scope
  3. Step-by-step derivation
  4. Reverse checks
  5. Result
  6. This question review and source binding

Return to catalogue page 35

← Question derivation index · Original question batch

R0012-06973 · q-20261011-advance-20261015-r01-fraction-0023

Original question and givens

Use legal integer fraction representations with nonzero original denominators; negative denominators are allowed. Representation and value remain distinct. a=10/2, b=1/3. The naive candidate adds the original numerators and original denominators separately, before reduction. Give (true sum, is naive addition defined?, naive value or undefined, naive−true defect or undefined, is naive addition correct?).

  • G001 — Use legal integer fraction representations with nonzero original denominators; negative denominators are allowed. Representation and value remain distinct. a=10/2, b=1/3. The naive candidate adds the original numerators and original denominators separately, before reduction. Give (true sum, is naive addition defined?, naive value or undefined, naive−true defect or undefined, is naive addition correct?).

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.

Step-by-step derivation

S001 · implies

Before

original integer numerator/denominator representations;original denominators nonzero

After

representation and rational value are distinct data

Conditions: none

Negative denominators are valid,but reduced values do not replace original representations.Candidate algorithms about raw numerators/denominators must use those raw data.This finite audit is not a general proof of quotient well-definedness.

Step identifiers and dependencies

Rule: fraction_representation_value_scope · Uses: G001

S002 · calculation

Before

true rational sum := sum(5, 1/3)

After

true rational sum = 16/3

Conditions: none

The true rational sum uses common-denominator addition,separate from naive representation addition.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S001

S003 · calculation

Before

naive raw numerator sum := sum(10, 1)

After

naive raw numerator sum = 11

Conditions: none

The naive candidate adds the two ORIGINAL numerators,not reduced numerators.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S002

S004 · calculation

Before

naive raw denominator sum := sum(2, 3)

After

naive raw denominator sum = 5

Conditions: none

Likewise add the ORIGINAL denominators;each being nonzero does not make their sum nonzero.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S003

S005 · calculation

Before

defined naive fraction candidate := div(11, 5)

After

defined naive fraction candidate = 11/5

Conditions: none

Only a nonzero original-denominator sum gives this candidate a rational value.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S004

S006 · calculation

Before

naive minus true sum := sub(11/5, 16/3)

After

naive minus true sum = -47/15

Conditions: none

Candidate minus true sum is the signed defect,not its absolute value.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S005

S007 · implies

Before

raw numerator sum=11;raw denominator sum=5;true sum=16/3

After

naive defined=Yes;naive=11/5;correct=No

Conditions: none

Adding numerators and denominators separately is not fraction addition.Prior reduction may change the specified WRONG algorithm,so retain raw representations.An undefined candidate is not correct even when the true sum is0.

Step identifiers and dependencies

Rule: raw_fraction_naive_addition_audit · Uses: G001, S006

Reverse checks

  • S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S006 · premise_and_result_audit — Recompute naive minus true sum with exact rational arithmetic, not rounded decimals.
  • S005 · premise_and_result_audit — Recompute defined naive fraction candidate with exact rational arithmetic, not rounded decimals.
  • S004 · premise_and_result_audit — Recompute naive raw denominator sum with exact rational arithmetic, not rounded decimals.
  • S003 · premise_and_result_audit — Recompute naive raw numerator sum with exact rational arithmetic, not rounded decimals.
  • S002 · premise_and_result_audit — Recompute true rational sum with exact rational arithmetic, not rounded decimals.
  • S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.

Result

(16/3, Yes, 11/5, -47/15, No)

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.

Source hashes and review receipts
  • input commit: 0f7be61e2c22317a4075561dc822c87d881a50db
  • original question SHA-256: ab3d35ab8dc0b550e6727025ff2f3930bc890e6eee4bff6b17260d7a4fce68ee
  • candidate record SHA-256: 0fb5660ccc5b181dab20ebbc36797b7071d1c2ed2d586ebf8198df633d820971
  • semantic review receipt SHA-256: 90dbc494b2d34ef51f412dcff63cfcc1a2215d038bff71f38f5dded4c64faf00
  • question-first witness SHA-256: b72a3b8bcf10f584396e0dd5198c657b0934a71864e5a3fa6321d7a613aef9f9
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON