Explore related knowledge and questions →

Question 24190: Residues Give Plus One and Nonresidues Minus One under the Qualified Criterion

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 121

← Question derivation index · Original question batch

R0047-24190 · q-20261015-advance-20261113-r04-euler-criterion-quadratic-residue-0065

Original question and givens

Use odd prime p=53, original a=13, normalized nonzero class. Give (prime, normalized_class, classification, nonzero_roots, Legendre_symbol, signed_power, equal, certificate).

  • G001 — Use odd prime p=53, original a=13, normalized nonzero class. Give (prime, normalized_class, classification, nonzero_roots, Legendre_symbol, signed_power, equal, certificate).

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 = [eulercrit-residue-nonresidue-cases]

After

derived = [[prime, normalized_class, classification, nonzero_roots, Legendre_symbol, signed_power, equal, certificate]]

Conditions: none

List the source field order without JavaScript.Gradient boundary uses its original mode to choose6,8 or7 fields;no padding or answer-derived mode.

Step identifiers and dependencies

Rule: source_ordered_fields_without_JS · Uses: G001

S002 · implies

Before

source roles = [53]

After

derived = [[[2, 1], [3, 2], [4, 1], [5, 3], [6, 5], [7, 4]], Yes]

Conditions: none

A composite has a factor at most its square root;complete trial division qualifies the modulus,not a guessed square/Euler equality.

Step identifiers and dependencies

Rule: Euler_modulus_primality_complete_trial · Uses: G001, S001

S003 · calculation

Before

Euler ORIGINAL signed quotient times modulus := mul(0, 53)

After

Euler ORIGINAL signed quotient times modulus = 0

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S002

S004 · calculation

Before

Euler ORIGINAL signed a minus modulus multiple := sub(13, 0)

After

Euler ORIGINAL signed a minus modulus multiple = 13

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S003

S005 · implies

Before

source roles = [13, 53, 0]

After

derived = [13, Yes]

Conditions: none

Use a=qp+r with0<=r<p,including negative a;retain original a where the interface requests it.

Step identifiers and dependencies

Rule: Euler_Euclidean_class_before_hypothesis · Uses: G001, S004

S006 · implies

Before

source roles = [53, 13, 13]

After

derived = [Yes, Yes]

Conditions: none

Qualify odd primality and the nonzero class first.Define Legendre by the square table before comparing a power.

Step identifiers and dependencies

Rule: Euler_odd_prime_nonzero_qualified · Uses: G001, S005

S007 · calculation

Before

Euler square root candidate1 := mul(1, 1)

After

Euler square root candidate1 = 1

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S006

S008 · calculation

Before

Euler square root candidate2 := mul(2, 2)

After

Euler square root candidate2 = 4

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S007

S009 · calculation

Before

Euler square root candidate3 := mul(3, 3)

After

Euler square root candidate3 = 9

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S008

S010 · calculation

Before

Euler square root candidate4 := mul(4, 4)

After

Euler square root candidate4 = 16

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S009

S011 · calculation

Before

Euler square root candidate5 := mul(5, 5)

After

Euler square root candidate5 = 25

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S010

S012 · calculation

Before

Euler square root candidate6 := mul(6, 6)

After

Euler square root candidate6 = 36

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S011

S013 · calculation

Before

Euler square root candidate7 := mul(7, 7)

After

Euler square root candidate7 = 49

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S012

S014 · calculation

Before

Euler square root candidate8 := mul(8, 8)

After

Euler square root candidate8 = 64

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S013

S015 · calculation

Before

Euler square root candidate9 := mul(9, 9)

After

Euler square root candidate9 = 81

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S014

S016 · calculation

Before

Euler square root candidate10 := mul(10, 10)

After

Euler square root candidate10 = 100

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S015

S017 · calculation

Before

Euler square root candidate11 := mul(11, 11)

After

Euler square root candidate11 = 121

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S016

S018 · calculation

Before

Euler square root candidate12 := mul(12, 12)

After

Euler square root candidate12 = 144

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S017

S019 · calculation

Before

Euler square root candidate13 := mul(13, 13)

After

Euler square root candidate13 = 169

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S018

S020 · calculation

Before

Euler square root candidate14 := mul(14, 14)

After

Euler square root candidate14 = 196

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S019

S021 · calculation

Before

Euler square root candidate15 := mul(15, 15)

After

Euler square root candidate15 = 225

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S020

S022 · calculation

Before

Euler square root candidate16 := mul(16, 16)

After

Euler square root candidate16 = 256

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S021

S023 · calculation

Before

Euler square root candidate17 := mul(17, 17)

After

Euler square root candidate17 = 289

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S022

S024 · calculation

Before

Euler square root candidate18 := mul(18, 18)

After

Euler square root candidate18 = 324

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S023

S025 · calculation

Before

Euler square root candidate19 := mul(19, 19)

After

Euler square root candidate19 = 361

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S024

S026 · calculation

Before

Euler square root candidate20 := mul(20, 20)

After

Euler square root candidate20 = 400

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S025

S027 · calculation

Before

Euler square root candidate21 := mul(21, 21)

After

Euler square root candidate21 = 441

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S026

S028 · calculation

Before

Euler square root candidate22 := mul(22, 22)

After

Euler square root candidate22 = 484

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S027

S029 · calculation

Before

Euler square root candidate23 := mul(23, 23)

After

Euler square root candidate23 = 529

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S028

S030 · calculation

Before

Euler square root candidate24 := mul(24, 24)

After

Euler square root candidate24 = 576

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S029

S031 · calculation

Before

Euler square root candidate25 := mul(25, 25)

After

Euler square root candidate25 = 625

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S030

S032 · calculation

Before

Euler square root candidate26 := mul(26, 26)

After

Euler square root candidate26 = 676

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S031

S033 · calculation

Before

Euler square root candidate27 := mul(27, 27)

After

Euler square root candidate27 = 729

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S032

S034 · calculation

Before

Euler square root candidate28 := mul(28, 28)

After

Euler square root candidate28 = 784

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S033

S035 · calculation

Before

Euler square root candidate29 := mul(29, 29)

After

Euler square root candidate29 = 841

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S034

S036 · calculation

Before

Euler square root candidate30 := mul(30, 30)

After

Euler square root candidate30 = 900

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S035

S037 · calculation

Before

Euler square root candidate31 := mul(31, 31)

After

Euler square root candidate31 = 961

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S036

S038 · calculation

Before

Euler square root candidate32 := mul(32, 32)

After

Euler square root candidate32 = 1024

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S037

S039 · calculation

Before

Euler square root candidate33 := mul(33, 33)

After

Euler square root candidate33 = 1089

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S038

S040 · calculation

Before

Euler square root candidate34 := mul(34, 34)

After

Euler square root candidate34 = 1156

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S039

S041 · calculation

Before

Euler square root candidate35 := mul(35, 35)

After

Euler square root candidate35 = 1225

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S040

S042 · calculation

Before

Euler square root candidate36 := mul(36, 36)

After

Euler square root candidate36 = 1296

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S041

S043 · calculation

Before

Euler square root candidate37 := mul(37, 37)

After

Euler square root candidate37 = 1369

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S042

S044 · calculation

Before

Euler square root candidate38 := mul(38, 38)

After

Euler square root candidate38 = 1444

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S043

S045 · calculation

Before

Euler square root candidate39 := mul(39, 39)

After

Euler square root candidate39 = 1521

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S044

S046 · calculation

Before

Euler square root candidate40 := mul(40, 40)

After

Euler square root candidate40 = 1600

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S045

S047 · calculation

Before

Euler square root candidate41 := mul(41, 41)

After

Euler square root candidate41 = 1681

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S046

S048 · calculation

Before

Euler square root candidate42 := mul(42, 42)

After

Euler square root candidate42 = 1764

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S047

S049 · calculation

Before

Euler square root candidate43 := mul(43, 43)

After

Euler square root candidate43 = 1849

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S048

S050 · calculation

Before

Euler square root candidate44 := mul(44, 44)

After

Euler square root candidate44 = 1936

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S049

S051 · calculation

Before

Euler square root candidate45 := mul(45, 45)

After

Euler square root candidate45 = 2025

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S050

S052 · calculation

Before

Euler square root candidate46 := mul(46, 46)

After

Euler square root candidate46 = 2116

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S051

S053 · calculation

Before

Euler square root candidate47 := mul(47, 47)

After

Euler square root candidate47 = 2209

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S052

S054 · calculation

Before

Euler square root candidate48 := mul(48, 48)

After

Euler square root candidate48 = 2304

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S053

S055 · calculation

Before

Euler square root candidate49 := mul(49, 49)

After

Euler square root candidate49 = 2401

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S054

S056 · calculation

Before

Euler square root candidate50 := mul(50, 50)

After

Euler square root candidate50 = 2500

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S055

S057 · calculation

Before

Euler square root candidate51 := mul(51, 51)

After

Euler square root candidate51 = 2601

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S056

S058 · calculation

Before

Euler square root candidate52 := mul(52, 52)

After

Euler square root candidate52 = 2704

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S057

S059 · implies

Before

source roles = [53, 13]

After

derived = [[[1, 1], [2, 4], [3, 9], [4, 16], [5, 25], [6, 36], [7, 49], [8, 11], [9, 28], [10, 47], [11, 15], [12, 38], [13, 10], [14, 37], [15, 13], [16, 44], [17, 24], [18, 6], [19, 43], [20, 29], [21, 17], [22, 7], [23, 52], [24, 46], [25, 42], [26, 40], [27, 40], [28, 42], [29, 46], [30, 52], [31, 7], [32, 17], [33, 29], [34, 43], [35, 6], [36, 24], [37, 44], [38, 13], [39, 37], [40, 10], [41, 38], [42, 15], [43, 47], [44, 28], [45, 11], [46, 49], [47, 36], [48, 25], [49, 16], [50, 9], [51, 4], [52, 1]], [15, 38], 1]

Conditions: none

Enumerate every nonzero square;roots give+1 and complete absence gives−1.This route does not use Euler criterion to compute Legendre.

Step identifiers and dependencies

Rule: Euler_ALL_nonzero_square_table_defines_Legendre · Uses: G001, S058

S060 · calculation

Before

Euler binary power square0 := mul(13, 13)

After

Euler binary power square0 = 169

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S059

S061 · implies

Before

source roles = [0, [1, 13, 26], 53, 13, 26]

After

derived = [null, 169, 1, 10, 13]

Conditions: none

Maintain acc*base^remaining congruent to the original half-power:accumulate an odd bit,square the base,and halve the exponent to0.This is separate from the square-table calculation.

Step identifiers and dependencies

Rule: Euler_repeated_squaring_original_exponent_invariant · Uses: G001, S060

S062 · calculation

Before

Euler binary power accumulate1 := mul(1, 10)

After

Euler binary power accumulate1 = 10

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S061

S063 · calculation

Before

Euler binary power square1 := mul(10, 10)

After

Euler binary power square1 = 100

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S062

S064 · implies

Before

source roles = [1, [1, 10, 13], 53, 13, 26]

After

derived = [10, 100, 10, 47, 6]

Conditions: none

Maintain acc*base^remaining congruent to the original half-power:accumulate an odd bit,square the base,and halve the exponent to0.This is separate from the square-table calculation.

Step identifiers and dependencies

Rule: Euler_repeated_squaring_original_exponent_invariant · Uses: G001, S063

S065 · calculation

Before

Euler binary power square2 := mul(47, 47)

After

Euler binary power square2 = 2209

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S064

S066 · implies

Before

source roles = [2, [10, 47, 6], 53, 13, 26]

After

derived = [null, 2209, 10, 36, 3]

Conditions: none

Maintain acc*base^remaining congruent to the original half-power:accumulate an odd bit,square the base,and halve the exponent to0.This is separate from the square-table calculation.

Step identifiers and dependencies

Rule: Euler_repeated_squaring_original_exponent_invariant · Uses: G001, S065

S067 · calculation

Before

Euler binary power accumulate3 := mul(10, 36)

After

Euler binary power accumulate3 = 360

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S066

S068 · calculation

Before

Euler binary power square3 := mul(36, 36)

After

Euler binary power square3 = 1296

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S067

S069 · implies

Before

source roles = [3, [10, 36, 3], 53, 13, 26]

After

derived = [360, 1296, 42, 24, 1]

Conditions: none

Maintain acc*base^remaining congruent to the original half-power:accumulate an odd bit,square the base,and halve the exponent to0.This is separate from the square-table calculation.

Step identifiers and dependencies

Rule: Euler_repeated_squaring_original_exponent_invariant · Uses: G001, S068

S070 · calculation

Before

Euler binary power accumulate4 := mul(42, 24)

After

Euler binary power accumulate4 = 1008

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S069

S071 · calculation

Before

Euler binary power square4 := mul(24, 24)

After

Euler binary power square4 = 576

Conditions: none

Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S070

S072 · implies

Before

source roles = [4, [42, 24, 1], 53, 13, 26]

After

derived = [1008, 576, 1, 46, 0]

Conditions: none

Maintain acc*base^remaining congruent to the original half-power:accumulate an odd bit,square the base,and halve the exponent to0.This is separate from the square-table calculation.

Step identifiers and dependencies

Rule: Euler_repeated_squaring_original_exponent_invariant · Uses: G001, S071

S073 · implies

Before

source roles = [53, [15, 38], 1, 1]

After

derived = [1, Yes, one finite instance is not a general theorem proof]

Conditions: none

p−1 represents−1 modulo p,not integer equality.Compare the two computations for this instance;one finite table is not a general theorem proof.

Step identifiers and dependencies

Rule: Euler_decode_p_minus1_and_instance_only_comparison · Uses: G001, S072

Reverse checks

  • S073 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S072 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S071 · premise_and_result_audit — Recompute Euler binary power square4 with exact rational arithmetic, not rounded decimals.
  • S070 · premise_and_result_audit — Recompute Euler binary power accumulate4 with exact rational arithmetic, not rounded decimals.
  • S069 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S068 · premise_and_result_audit — Recompute Euler binary power square3 with exact rational arithmetic, not rounded decimals.
  • S067 · premise_and_result_audit — Recompute Euler binary power accumulate3 with exact rational arithmetic, not rounded decimals.
  • S066 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S065 · premise_and_result_audit — Recompute Euler binary power square2 with exact rational arithmetic, not rounded decimals.
  • S064 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S063 · premise_and_result_audit — Recompute Euler binary power square1 with exact rational arithmetic, not rounded decimals.
  • S062 · premise_and_result_audit — Recompute Euler binary power accumulate1 with exact rational arithmetic, not rounded decimals.
  • S061 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S060 · premise_and_result_audit — Recompute Euler binary power square0 with exact rational arithmetic, not rounded decimals.
  • S059 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S058 · premise_and_result_audit — Recompute Euler square root candidate52 with exact rational arithmetic, not rounded decimals.
  • S057 · premise_and_result_audit — Recompute Euler square root candidate51 with exact rational arithmetic, not rounded decimals.
  • S056 · premise_and_result_audit — Recompute Euler square root candidate50 with exact rational arithmetic, not rounded decimals.
  • S055 · premise_and_result_audit — Recompute Euler square root candidate49 with exact rational arithmetic, not rounded decimals.
  • S054 · premise_and_result_audit — Recompute Euler square root candidate48 with exact rational arithmetic, not rounded decimals.
  • S053 · premise_and_result_audit — Recompute Euler square root candidate47 with exact rational arithmetic, not rounded decimals.
  • S052 · premise_and_result_audit — Recompute Euler square root candidate46 with exact rational arithmetic, not rounded decimals.
  • S051 · premise_and_result_audit — Recompute Euler square root candidate45 with exact rational arithmetic, not rounded decimals.
  • S050 · premise_and_result_audit — Recompute Euler square root candidate44 with exact rational arithmetic, not rounded decimals.
  • S049 · premise_and_result_audit — Recompute Euler square root candidate43 with exact rational arithmetic, not rounded decimals.
  • S048 · premise_and_result_audit — Recompute Euler square root candidate42 with exact rational arithmetic, not rounded decimals.
  • S047 · premise_and_result_audit — Recompute Euler square root candidate41 with exact rational arithmetic, not rounded decimals.
  • S046 · premise_and_result_audit — Recompute Euler square root candidate40 with exact rational arithmetic, not rounded decimals.
  • S045 · premise_and_result_audit — Recompute Euler square root candidate39 with exact rational arithmetic, not rounded decimals.
  • S044 · premise_and_result_audit — Recompute Euler square root candidate38 with exact rational arithmetic, not rounded decimals.
  • S043 · premise_and_result_audit — Recompute Euler square root candidate37 with exact rational arithmetic, not rounded decimals.
  • S042 · premise_and_result_audit — Recompute Euler square root candidate36 with exact rational arithmetic, not rounded decimals.
  • S041 · premise_and_result_audit — Recompute Euler square root candidate35 with exact rational arithmetic, not rounded decimals.
  • S040 · premise_and_result_audit — Recompute Euler square root candidate34 with exact rational arithmetic, not rounded decimals.
  • S039 · premise_and_result_audit — Recompute Euler square root candidate33 with exact rational arithmetic, not rounded decimals.
  • S038 · premise_and_result_audit — Recompute Euler square root candidate32 with exact rational arithmetic, not rounded decimals.
  • S037 · premise_and_result_audit — Recompute Euler square root candidate31 with exact rational arithmetic, not rounded decimals.
  • S036 · premise_and_result_audit — Recompute Euler square root candidate30 with exact rational arithmetic, not rounded decimals.
  • S035 · premise_and_result_audit — Recompute Euler square root candidate29 with exact rational arithmetic, not rounded decimals.
  • S034 · premise_and_result_audit — Recompute Euler square root candidate28 with exact rational arithmetic, not rounded decimals.
  • S033 · premise_and_result_audit — Recompute Euler square root candidate27 with exact rational arithmetic, not rounded decimals.
  • S032 · premise_and_result_audit — Recompute Euler square root candidate26 with exact rational arithmetic, not rounded decimals.
  • S031 · premise_and_result_audit — Recompute Euler square root candidate25 with exact rational arithmetic, not rounded decimals.
  • S030 · premise_and_result_audit — Recompute Euler square root candidate24 with exact rational arithmetic, not rounded decimals.
  • S029 · premise_and_result_audit — Recompute Euler square root candidate23 with exact rational arithmetic, not rounded decimals.
  • S028 · premise_and_result_audit — Recompute Euler square root candidate22 with exact rational arithmetic, not rounded decimals.
  • S027 · premise_and_result_audit — Recompute Euler square root candidate21 with exact rational arithmetic, not rounded decimals.
  • S026 · premise_and_result_audit — Recompute Euler square root candidate20 with exact rational arithmetic, not rounded decimals.
  • S025 · premise_and_result_audit — Recompute Euler square root candidate19 with exact rational arithmetic, not rounded decimals.
  • S024 · premise_and_result_audit — Recompute Euler square root candidate18 with exact rational arithmetic, not rounded decimals.
  • S023 · premise_and_result_audit — Recompute Euler square root candidate17 with exact rational arithmetic, not rounded decimals.
  • S022 · premise_and_result_audit — Recompute Euler square root candidate16 with exact rational arithmetic, not rounded decimals.
  • S021 · premise_and_result_audit — Recompute Euler square root candidate15 with exact rational arithmetic, not rounded decimals.
  • S020 · premise_and_result_audit — Recompute Euler square root candidate14 with exact rational arithmetic, not rounded decimals.
  • S019 · premise_and_result_audit — Recompute Euler square root candidate13 with exact rational arithmetic, not rounded decimals.
  • S018 · premise_and_result_audit — Recompute Euler square root candidate12 with exact rational arithmetic, not rounded decimals.
  • S017 · premise_and_result_audit — Recompute Euler square root candidate11 with exact rational arithmetic, not rounded decimals.
  • S016 · premise_and_result_audit — Recompute Euler square root candidate10 with exact rational arithmetic, not rounded decimals.
  • S015 · premise_and_result_audit — Recompute Euler square root candidate9 with exact rational arithmetic, not rounded decimals.
  • S014 · premise_and_result_audit — Recompute Euler square root candidate8 with exact rational arithmetic, not rounded decimals.
  • S013 · premise_and_result_audit — Recompute Euler square root candidate7 with exact rational arithmetic, not rounded decimals.
  • S012 · premise_and_result_audit — Recompute Euler square root candidate6 with exact rational arithmetic, not rounded decimals.
  • S011 · premise_and_result_audit — Recompute Euler square root candidate5 with exact rational arithmetic, not rounded decimals.
  • S010 · premise_and_result_audit — Recompute Euler square root candidate4 with exact rational arithmetic, not rounded decimals.
  • S009 · premise_and_result_audit — Recompute Euler square root candidate3 with exact rational arithmetic, not rounded decimals.
  • S008 · premise_and_result_audit — Recompute Euler square root candidate2 with exact rational arithmetic, not rounded decimals.
  • S007 · premise_and_result_audit — Recompute Euler square root candidate1 with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute Euler ORIGINAL signed a minus modulus multiple with exact rational arithmetic, not rounded decimals.
  • S003 · premise_and_result_audit — Recompute Euler ORIGINAL signed quotient times modulus with exact rational arithmetic, not rounded decimals.
  • 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

(53, 13, quadratic_residue, [15, 38], 1, 1, Yes, residue_maps_to_plus_one)

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: 49db04bbc826e0a9f6dfefbfe306afb7a8c3b0a1473dc8dbc296bcf6ecdb4435
  • candidate record SHA-256: e9e8207d42f8ff177e29c05e24d13ff6a20e5a4283c9794cd1723cc9a2d4c32a
  • semantic review receipt SHA-256: 9b43b9823e9bd2478d6caa5b57ffed161c2c8956af86974e901d5662ad994386
  • question-first witness SHA-256: eb97596068e2d5648033bab2b8f6ca9b653bbe8cb77c0f8e1d16d0c40e46f50b
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON