Step-by-step derivation
S001 · implies
Before
totient multiplicativity coprimality premise:original nonnegative Euclidean inputs=[2, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[2, 17, 0, 2], [17, 2, 8, 1], [2, 1, 2, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001
S002 · calculation
Before
totient multiplicativity original modulus product := mul(2, 17)
After
totient multiplicativity original modulus product = 34
Conditions: none
Compute exactly from original roles and established intermediates,retaining indices,denominators,signs and operation roles.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S001
S003 · implies
Before
left modulus representative1:original nonnegative Euclidean inputs=[1, 2]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[1, 2, 0, 1], [2, 1, 2, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S002
S004 · implies
Before
left modulus:original representative k=1 in1..2;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S003
S005 · implies
Before
left modulus representative2:original nonnegative Euclidean inputs=[2, 2]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[2, 2, 1, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S004
S006 · implies
Before
left modulus:original representative k=2 in1..2;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S005
S007 · calculation
Before
left modulus exact coprime indicator count := sum(1, 0)
After
left modulus exact coprime indicator count = 1
Conditions: none
Compute exactly from original roles and established intermediates,retaining indices,denominators,signs and operation roles.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S006
S008 · implies
Before
left modulus:complete representative range1..2;all selected coprime representatives=[1]
After
phi(2)=1;representatives_1_through_n
Conditions: none
Sum every indicator for the exact count.This is complete finite counting for the supplied n,not a general formula extrapolated from samples.
Step identifiers and dependencies
Rule: totient_complete_finite_count_not_sample_formula · Uses: G001, S007
S009 · implies
Before
right modulus representative1:original nonnegative Euclidean inputs=[1, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[1, 17, 0, 1], [17, 1, 17, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S008
S010 · implies
Before
right modulus:original representative k=1 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S009
S011 · implies
Before
right modulus representative2:original nonnegative Euclidean inputs=[2, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[2, 17, 0, 2], [17, 2, 8, 1], [2, 1, 2, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S010
S012 · implies
Before
right modulus:original representative k=2 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S011
S013 · implies
Before
right modulus representative3:original nonnegative Euclidean inputs=[3, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[3, 17, 0, 3], [17, 3, 5, 2], [3, 2, 1, 1], [2, 1, 2, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S012
S014 · implies
Before
right modulus:original representative k=3 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S013
S015 · implies
Before
right modulus representative4:original nonnegative Euclidean inputs=[4, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[4, 17, 0, 4], [17, 4, 4, 1], [4, 1, 4, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S014
S016 · implies
Before
right modulus:original representative k=4 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S015
S017 · implies
Before
right modulus representative5:original nonnegative Euclidean inputs=[5, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[5, 17, 0, 5], [17, 5, 3, 2], [5, 2, 2, 1], [2, 1, 2, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S016
S018 · implies
Before
right modulus:original representative k=5 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S017
S019 · implies
Before
right modulus representative6:original nonnegative Euclidean inputs=[6, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[6, 17, 0, 6], [17, 6, 2, 5], [6, 5, 1, 1], [5, 1, 5, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S018
S020 · implies
Before
right modulus:original representative k=6 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S019
S021 · implies
Before
right modulus representative7:original nonnegative Euclidean inputs=[7, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[7, 17, 0, 7], [17, 7, 2, 3], [7, 3, 2, 1], [3, 1, 3, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S020
S022 · implies
Before
right modulus:original representative k=7 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S021
S023 · implies
Before
right modulus representative8:original nonnegative Euclidean inputs=[8, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[8, 17, 0, 8], [17, 8, 2, 1], [8, 1, 8, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S022
S024 · implies
Before
right modulus:original representative k=8 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S023
S025 · implies
Before
right modulus representative9:original nonnegative Euclidean inputs=[9, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[9, 17, 0, 9], [17, 9, 1, 8], [9, 8, 1, 1], [8, 1, 8, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S024
S026 · implies
Before
right modulus:original representative k=9 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S025
S027 · implies
Before
right modulus representative10:original nonnegative Euclidean inputs=[10, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[10, 17, 0, 10], [17, 10, 1, 7], [10, 7, 1, 3], [7, 3, 2, 1], [3, 1, 3, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S026
S028 · implies
Before
right modulus:original representative k=10 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S027
S029 · implies
Before
right modulus representative11:original nonnegative Euclidean inputs=[11, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[11, 17, 0, 11], [17, 11, 1, 6], [11, 6, 1, 5], [6, 5, 1, 1], [5, 1, 5, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S028
S030 · implies
Before
right modulus:original representative k=11 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S029
S031 · implies
Before
right modulus representative12:original nonnegative Euclidean inputs=[12, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[12, 17, 0, 12], [17, 12, 1, 5], [12, 5, 2, 2], [5, 2, 2, 1], [2, 1, 2, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S030
S032 · implies
Before
right modulus:original representative k=12 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S031
S033 · implies
Before
right modulus representative13:original nonnegative Euclidean inputs=[13, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[13, 17, 0, 13], [17, 13, 1, 4], [13, 4, 3, 1], [4, 1, 4, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S032
S034 · implies
Before
right modulus:original representative k=13 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S033
S035 · implies
Before
right modulus representative14:original nonnegative Euclidean inputs=[14, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[14, 17, 0, 14], [17, 14, 1, 3], [14, 3, 4, 2], [3, 2, 1, 1], [2, 1, 2, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S034
S036 · implies
Before
right modulus:original representative k=14 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S035
S037 · implies
Before
right modulus representative15:original nonnegative Euclidean inputs=[15, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[15, 17, 0, 15], [17, 15, 1, 2], [15, 2, 7, 1], [2, 1, 2, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S036
S038 · implies
Before
right modulus:original representative k=15 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S037
S039 · implies
Before
right modulus representative16:original nonnegative Euclidean inputs=[16, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[16, 17, 0, 16], [17, 16, 1, 1], [16, 1, 16, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S038
S040 · implies
Before
right modulus:original representative k=16 in1..17;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S039
S041 · implies
Before
right modulus representative17:original nonnegative Euclidean inputs=[17, 17]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[17, 17, 1, 0]];terminal positive gcd=17
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S040
S042 · implies
Before
right modulus:original representative k=17 in1..17;verified gcd(k,n)=17
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S041
S043 · calculation
Before
right modulus exact coprime indicator count := sum(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0)
After
right modulus exact coprime indicator count = 16
Conditions: none
Compute exactly from original roles and established intermediates,retaining indices,denominators,signs and operation roles.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S042
S044 · implies
Before
right modulus:complete representative range1..17;all selected coprime representatives=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]
After
phi(17)=16;representatives_1_through_n
Conditions: none
Sum every indicator for the exact count.This is complete finite counting for the supplied n,not a general formula extrapolated from samples.
Step identifiers and dependencies
Rule: totient_complete_finite_count_not_sample_formula · Uses: G001, S043
S045 · implies
Before
product modulus representative1:original nonnegative Euclidean inputs=[1, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[1, 34, 0, 1], [34, 1, 34, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S044
S046 · implies
Before
product modulus:original representative k=1 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S045
S047 · implies
Before
product modulus representative2:original nonnegative Euclidean inputs=[2, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[2, 34, 0, 2], [34, 2, 17, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S046
S048 · implies
Before
product modulus:original representative k=2 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S047
S049 · implies
Before
product modulus representative3:original nonnegative Euclidean inputs=[3, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[3, 34, 0, 3], [34, 3, 11, 1], [3, 1, 3, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S048
S050 · implies
Before
product modulus:original representative k=3 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S049
S051 · implies
Before
product modulus representative4:original nonnegative Euclidean inputs=[4, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[4, 34, 0, 4], [34, 4, 8, 2], [4, 2, 2, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S050
S052 · implies
Before
product modulus:original representative k=4 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S051
S053 · implies
Before
product modulus representative5:original nonnegative Euclidean inputs=[5, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[5, 34, 0, 5], [34, 5, 6, 4], [5, 4, 1, 1], [4, 1, 4, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S052
S054 · implies
Before
product modulus:original representative k=5 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S053
S055 · implies
Before
product modulus representative6:original nonnegative Euclidean inputs=[6, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[6, 34, 0, 6], [34, 6, 5, 4], [6, 4, 1, 2], [4, 2, 2, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S054
S056 · implies
Before
product modulus:original representative k=6 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S055
S057 · implies
Before
product modulus representative7:original nonnegative Euclidean inputs=[7, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[7, 34, 0, 7], [34, 7, 4, 6], [7, 6, 1, 1], [6, 1, 6, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S056
S058 · implies
Before
product modulus:original representative k=7 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S057
S059 · implies
Before
product modulus representative8:original nonnegative Euclidean inputs=[8, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[8, 34, 0, 8], [34, 8, 4, 2], [8, 2, 4, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S058
S060 · implies
Before
product modulus:original representative k=8 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S059
S061 · implies
Before
product modulus representative9:original nonnegative Euclidean inputs=[9, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[9, 34, 0, 9], [34, 9, 3, 7], [9, 7, 1, 2], [7, 2, 3, 1], [2, 1, 2, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S060
S062 · implies
Before
product modulus:original representative k=9 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S061
S063 · implies
Before
product modulus representative10:original nonnegative Euclidean inputs=[10, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[10, 34, 0, 10], [34, 10, 3, 4], [10, 4, 2, 2], [4, 2, 2, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S062
S064 · implies
Before
product modulus:original representative k=10 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S063
S065 · implies
Before
product modulus representative11:original nonnegative Euclidean inputs=[11, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[11, 34, 0, 11], [34, 11, 3, 1], [11, 1, 11, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S064
S066 · implies
Before
product modulus:original representative k=11 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S065
S067 · implies
Before
product modulus representative12:original nonnegative Euclidean inputs=[12, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[12, 34, 0, 12], [34, 12, 2, 10], [12, 10, 1, 2], [10, 2, 5, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S066
S068 · implies
Before
product modulus:original representative k=12 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S067
S069 · implies
Before
product modulus representative13:original nonnegative Euclidean inputs=[13, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[13, 34, 0, 13], [34, 13, 2, 8], [13, 8, 1, 5], [8, 5, 1, 3], [5, 3, 1, 2], [3, 2, 1, 1], [2, 1, 2, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S068
S070 · implies
Before
product modulus:original representative k=13 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S069
S071 · implies
Before
product modulus representative14:original nonnegative Euclidean inputs=[14, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[14, 34, 0, 14], [34, 14, 2, 6], [14, 6, 2, 2], [6, 2, 3, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S070
S072 · implies
Before
product modulus:original representative k=14 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S071
S073 · implies
Before
product modulus representative15:original nonnegative Euclidean inputs=[15, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[15, 34, 0, 15], [34, 15, 2, 4], [15, 4, 3, 3], [4, 3, 1, 1], [3, 1, 3, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S072
S074 · implies
Before
product modulus:original representative k=15 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S073
S075 · implies
Before
product modulus representative16:original nonnegative Euclidean inputs=[16, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[16, 34, 0, 16], [34, 16, 2, 2], [16, 2, 8, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S074
S076 · implies
Before
product modulus:original representative k=16 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S075
S077 · implies
Before
product modulus representative17:original nonnegative Euclidean inputs=[17, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[17, 34, 0, 17], [34, 17, 2, 0]];terminal positive gcd=17
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S076
S078 · implies
Before
product modulus:original representative k=17 in1..34;verified gcd(k,n)=17
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S077
S079 · implies
Before
product modulus representative18:original nonnegative Euclidean inputs=[18, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[18, 34, 0, 18], [34, 18, 1, 16], [18, 16, 1, 2], [16, 2, 8, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S078
S080 · implies
Before
product modulus:original representative k=18 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S079
S081 · implies
Before
product modulus representative19:original nonnegative Euclidean inputs=[19, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[19, 34, 0, 19], [34, 19, 1, 15], [19, 15, 1, 4], [15, 4, 3, 3], [4, 3, 1, 1], [3, 1, 3, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S080
S082 · implies
Before
product modulus:original representative k=19 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S081
S083 · implies
Before
product modulus representative20:original nonnegative Euclidean inputs=[20, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[20, 34, 0, 20], [34, 20, 1, 14], [20, 14, 1, 6], [14, 6, 2, 2], [6, 2, 3, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S082
S084 · implies
Before
product modulus:original representative k=20 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S083
S085 · implies
Before
product modulus representative21:original nonnegative Euclidean inputs=[21, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[21, 34, 0, 21], [34, 21, 1, 13], [21, 13, 1, 8], [13, 8, 1, 5], [8, 5, 1, 3], [5, 3, 1, 2], [3, 2, 1, 1], [2, 1, 2, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S084
S086 · implies
Before
product modulus:original representative k=21 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S085
S087 · implies
Before
product modulus representative22:original nonnegative Euclidean inputs=[22, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[22, 34, 0, 22], [34, 22, 1, 12], [22, 12, 1, 10], [12, 10, 1, 2], [10, 2, 5, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S086
S088 · implies
Before
product modulus:original representative k=22 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S087
S089 · implies
Before
product modulus representative23:original nonnegative Euclidean inputs=[23, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[23, 34, 0, 23], [34, 23, 1, 11], [23, 11, 2, 1], [11, 1, 11, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S088
S090 · implies
Before
product modulus:original representative k=23 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S089
S091 · implies
Before
product modulus representative24:original nonnegative Euclidean inputs=[24, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[24, 34, 0, 24], [34, 24, 1, 10], [24, 10, 2, 4], [10, 4, 2, 2], [4, 2, 2, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S090
S092 · implies
Before
product modulus:original representative k=24 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S091
S093 · implies
Before
product modulus representative25:original nonnegative Euclidean inputs=[25, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[25, 34, 0, 25], [34, 25, 1, 9], [25, 9, 2, 7], [9, 7, 1, 2], [7, 2, 3, 1], [2, 1, 2, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S092
S094 · implies
Before
product modulus:original representative k=25 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S093
S095 · implies
Before
product modulus representative26:original nonnegative Euclidean inputs=[26, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[26, 34, 0, 26], [34, 26, 1, 8], [26, 8, 3, 2], [8, 2, 4, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S094
S096 · implies
Before
product modulus:original representative k=26 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S095
S097 · implies
Before
product modulus representative27:original nonnegative Euclidean inputs=[27, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[27, 34, 0, 27], [34, 27, 1, 7], [27, 7, 3, 6], [7, 6, 1, 1], [6, 1, 6, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S096
S098 · implies
Before
product modulus:original representative k=27 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S097
S099 · implies
Before
product modulus representative28:original nonnegative Euclidean inputs=[28, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[28, 34, 0, 28], [34, 28, 1, 6], [28, 6, 4, 4], [6, 4, 1, 2], [4, 2, 2, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S098
S100 · implies
Before
product modulus:original representative k=28 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S099
S101 · implies
Before
product modulus representative29:original nonnegative Euclidean inputs=[29, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[29, 34, 0, 29], [34, 29, 1, 5], [29, 5, 5, 4], [5, 4, 1, 1], [4, 1, 4, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S100
S102 · implies
Before
product modulus:original representative k=29 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S101
S103 · implies
Before
product modulus representative30:original nonnegative Euclidean inputs=[30, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[30, 34, 0, 30], [34, 30, 1, 4], [30, 4, 7, 2], [4, 2, 2, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S102
S104 · implies
Before
product modulus:original representative k=30 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S103
S105 · implies
Before
product modulus representative31:original nonnegative Euclidean inputs=[31, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[31, 34, 0, 31], [34, 31, 1, 3], [31, 3, 10, 1], [3, 1, 3, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S104
S106 · implies
Before
product modulus:original representative k=31 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S105
S107 · implies
Before
product modulus representative32:original nonnegative Euclidean inputs=[32, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[32, 34, 0, 32], [34, 32, 1, 2], [32, 2, 16, 0]];terminal positive gcd=2
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S106
S108 · implies
Before
product modulus:original representative k=32 in1..34;verified gcd(k,n)=2
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S107
S109 · implies
Before
product modulus representative33:original nonnegative Euclidean inputs=[33, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[33, 34, 0, 33], [34, 33, 1, 1], [33, 1, 33, 0]];terminal positive gcd=1
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S108
S110 · implies
Before
product modulus:original representative k=33 in1..34;verified gcd(k,n)=1
After
coprime indicator=1;include representative=Yes
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S109
S111 · implies
Before
product modulus representative34:original nonnegative Euclidean inputs=[34, 34]
After
division rows[a,b,q,r] with a=q*b+r and0<=r<b=[[34, 34, 1, 0]];terminal positive gcd=34
Conditions: none
Each row gives a=q*b+r with its remainder bound.The pairs(a,b)and(b,r)have exactly the same common divisors.Repeat until the second entry is0;the last nonzero value is the gcd.This is an exact chain,not a floating-point approximation or an unexplained answer.
Step identifiers and dependencies
Rule: totient_Euclidean_division_chain_preserves_common_divisors · Uses: G001, S110
S112 · implies
Before
product modulus:original representative k=34 in1..34;verified gcd(k,n)=34
After
coprime indicator=0;include representative=No
Conditions: none
Test gcd=1 for every original representative1 through n exactly once.Include only qualifying representatives.For n=1 the representative is1 and gcd(1,1)=1;do not switch to a different0-through-n−1 list.
Step identifiers and dependencies
Rule: totient_every_original_representative_unit_gcd_test · Uses: G001, S111
S113 · calculation
Before
product modulus exact coprime indicator count := sum(1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0)
After
product modulus exact coprime indicator count = 16
Conditions: none
Compute exactly from original roles and established intermediates,retaining indices,denominators,signs and operation roles.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S112
S114 · implies
Before
product modulus:complete representative range1..34;all selected coprime representatives=[1, 3, 5, 7, 9, 11, 13, 15, 19, 21, 23, 25, 27, 29, 31, 33]
After
phi(34)=16;representatives_1_through_n
Conditions: none
Sum every indicator for the exact count.This is complete finite counting for the supplied n,not a general formula extrapolated from samples.
Step identifiers and dependencies
Rule: totient_complete_finite_count_not_sample_formula · Uses: G001, S113
S115 · calculation
Before
totient supplied instance product of counts := mul(1, 16)
After
totient supplied instance product of counts = 16
Conditions: none
Compute exactly from original roles and established intermediates,retaining indices,denominators,signs and operation roles.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S114
S116 · implies
Before
original coprime inputs=[2, 17];gcd=1;product modulus=34;exact totients=[1, 16, 16]
After
phi(m)*phi(n)=16;same supplied-instance equality=Yes;instance_only_with_coprimality
Conditions: none
First verify coprimality and all three allowed moduli,then count the three totients completely and compare.This checks the supplied instance only.Non-coprime inputs do not qualify,and numeric agreement is not a proof of the universal multiplicativity theorem.
Step identifiers and dependencies
Rule: totient_coprime_instance_not_unrestricted_multiplicativity_proof · Uses: G001, S115