Explore related knowledge and questions →

Question 35541: Coordinate-Plane Distance

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 178

← Question derivation index · Original question batch

R0070-35541 · q-20260912-distance-coordinate-0026

Original question and givens

In the Euclidean plane, P=(11, -16) and Q=(-7, 64). Find the distance d(P,Q).

  • G001 — In the Euclidean plane, P=(11, -16) and Q=(-7, 64). Find the distance d(P,Q).

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

source roles = [qf-distance-coordinate, [expected_distance, p, q]]

After

derived = [distance, null, null]

Conditions: none

Use THIS bank’s actual fields,operation/domain and types.BASE retains permissible extra metadata.Do not import LDL SAFE/set limits or a different bank’s deduplication rules.

Step identifiers and dependencies

Rule: R70_SOURCE_bank_specific_interface · Uses: G001

S002 · implies

Before

source roles = [[11, -16], [-7, 64]]

After

derived = [orthonormal common coordinate frame]

Conditions: none

These LAST FIVE questions give integral coordinates in ONE Euclidean frame.Distance is neither the sum of coordinate differences nor Manhattan distance;expected_distance metadata is NOT an oracle.

Step identifiers and dependencies

Rule: Distance_GIVEN_same_Euclidean_frame_integral_last5 · Uses: G001, S001

S003 · calculation

Before

Distance ORIGINAL coordinate difference i=0 := sub(-7, 11)

After

Distance ORIGINAL coordinate difference i=0 = -18

Conditions: none

This step displays the exact original operands and operation.Mul/sub/div have EXACTLY TWO inputs.Keep rational values exact and derived BigInts unbounded;do not force an answer by approximation.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S002

S004 · calculation

Before

Distance square signed difference i=0 := mul(-18, -18)

After

Distance square signed difference i=0 = 324

Conditions: none

This step displays the exact original operands and operation.Mul/sub/div have EXACTLY TWO inputs.Keep rational values exact and derived BigInts unbounded;do not force an answer by approximation.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S003

S005 · calculation

Before

Distance ORIGINAL coordinate difference i=1 := sub(64, -16)

After

Distance ORIGINAL coordinate difference i=1 = 80

Conditions: none

This step displays the exact original operands and operation.Mul/sub/div have EXACTLY TWO inputs.Keep rational values exact and derived BigInts unbounded;do not force an answer by approximation.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S004

S006 · calculation

Before

Distance square signed difference i=1 := mul(80, 80)

After

Distance square signed difference i=1 = 6400

Conditions: none

This step displays the exact original operands and operation.Mul/sub/div have EXACTLY TWO inputs.Keep rational values exact and derived BigInts unbounded;do not force an answer by approximation.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S005

S007 · calculation

Before

Distance sum BOTH coordinate squares := sum(324, 6400)

After

Distance sum BOTH coordinate squares = 6724

Conditions: none

This step displays the exact original operands and operation.Mul/sub/div have EXACTLY TWO inputs.Keep rational values exact and derived BigInts unbounded;do not force an answer by approximation.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S006

S008 · calculation

Before

Distance principal nonnegative root squared back := mul(82, 82)

After

Distance principal nonnegative root squared back = 6724

Conditions: none

This step displays the exact original operands and operation.Mul/sub/div have EXACTLY TWO inputs.Keep rational values exact and derived BigInts unbounded;do not force an answer by approximation.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S007

S009 · implies

Before

source roles = [[-18, 80], 6724]

After

derived = [82]

Conditions: none

The sum of BOTH squared components is d².Distance is nonnegative,so choose the principal root and square it back EXACTLY.Neither a negative root nor expected-answer backsolving is allowed.

Step identifiers and dependencies

Rule: Distance_PRINCIPAL_root_not_negative_or_approximate · Uses: G001, S008

Reverse checks

  • S009 · premise_and_result_audit — Reverse-audit THIS question’s original operands,roles and necessary premises;reconstruct the next step,without reversing a one-way implication.Numerical/finite-table checking is not formal proof of an arbitrary theorem.Original Q,bilingual sources,MKO,AST,status and history remain preserved.
  • S008 · premise_and_result_audit — Recompute Distance principal nonnegative root squared back with exact rational arithmetic, not rounded decimals.
  • S007 · premise_and_result_audit — Recompute Distance sum BOTH coordinate squares with exact rational arithmetic, not rounded decimals.
  • S006 · premise_and_result_audit — Recompute Distance square signed difference i=1 with exact rational arithmetic, not rounded decimals.
  • S005 · premise_and_result_audit — Recompute Distance ORIGINAL coordinate difference i=1 with exact rational arithmetic, not rounded decimals.
  • S004 · premise_and_result_audit — Recompute Distance square signed difference i=0 with exact rational arithmetic, not rounded decimals.
  • S003 · premise_and_result_audit — Recompute Distance ORIGINAL coordinate difference i=0 with exact rational arithmetic, not rounded decimals.
  • S002 · premise_and_result_audit — Reverse-audit THIS question’s original operands,roles and necessary premises;reconstruct the next step,without reversing a one-way implication.Numerical/finite-table checking is not formal proof of an arbitrary theorem.Original Q,bilingual sources,MKO,AST,status and history remain preserved.
  • S001 · premise_and_result_audit — Reverse-audit THIS question’s original operands,roles and necessary premises;reconstruct the next step,without reversing a one-way implication.Numerical/finite-table checking is not formal proof of an arbitrary theorem.Original Q,bilingual sources,MKO,AST,status and history remain preserved.

Result

82

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: 577c0bfe69890027ec976451a5798253cf96df263500ebb636e56c6fc3c9c9ac
  • candidate record SHA-256: 55df8cc0a3622181cb2038f373986311daad24586ea4c177b01a41198c1e024f
  • semantic review receipt SHA-256: 9820ac6529139bd53d516c8bfdfdd41184b0cd52dad69fa433344010db37af80
  • question-first witness SHA-256: c9c939762bbd4d3ea3403084c8e95541dc2c7e56eb82fc74eaba8c80a4517dab
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON