Why the Great Wall is the best wonder in the game. Watch what happens when I fail to build it lol ... https://www.youtube.com/watch?v=kYD3-XReIKE

Music : Rains of Castamere https://youtu.be/ICLgN-OY5Us Oakland County Recorder Data https://docs.google.com/spreadsheets/d/1iNAkGavumvvDjKBNABH7T4S5FIUohDlsq1kLPUybIPU/edit?usp=sharing Macomb County Recorder Data https://docs.google.com/spreadsheets/d/1dzobdIuV7WC7JjqIVky7aCJ3tfpaJz8VcnQBYY1Vjgw/edit?usp=sharing Basic Michigan Algorithm: https://www.desmos.com/calculator/8ibu8ydios f(x) = reflection line; z(x) = proportion of Mail-ins to Election Day Votes, 2000 MiV votes to 1000 EDV votes means z(x) = 2 b1(x) = Biden EDV%; t2(x) = TrumpMIV % b2(x) = Biden Miv%; t1(x) = Trump EDV% The algorithm solves as t2 as a function of b1. (t1 is implied by b1, regardless of whether or not the election is or isn't fair, since t1 is always equal to 100%-b1). (b2 is implied by t1, regardless of whether or not the election is or isn't fair, since b2 is always equal to 100%-t1). a(x) = Biden's Aggregate Percentage for the entire precinct. Since b1(x), b2(x), t1(x), t2(x) and a(x) are all forced, one only needs the reflection constant and lambda and the predetermined aggregate a(x) to generate both candidates percentages for both the MiV and EDV. The intersection of the line x = k, (k bounded from 0 to 1) with all five percentage functions are the percentages of the candidate's. If a desired value of a(x) exists between 0% and 100% from x bounded from 0 to 1, then the algorithm simply reads the values of the functions b1(x), b2(x), t1(x) and t2(x) and multiples those percentages against the respective vote totals and generates the Tabulation Record. If a(x) does not exist, either the proportion z(x) must be increased, or the reflection line f(x) must be decreased. We note that at z(x) = 3 and f(x) = 0.25, that a(x) cannot drop below 50%, guaranteeing a victory for the candidate, even if they get 0% of the election day vote; thus one only requires a 3:1 ratio of MiV ballots to EDV ballots to guarantee a victory at the precinct, since if b1(x) = 0% EDV then b2(x) = 66.667%, MIV therefore the aggregate of 0% and 66.667% at a ratio of 3 MIV to 1 EDV ballot is an aggregate that exceeds 50%. Macomb County Recorder Website: https://electionresults.macombgov.org/m31/results.html Thesis Paper: https://docs.google.com/document/d/1Jj9ASctIWDhcpesR8d3r-qj9Ez6uxIIsFfxgkuNJgZE/edit?usp=sharing Source Video for the Derivation: https://www.youtube.com/watch?v=C5o2kUjevUA Michigan Engine (link is safe ignore warning): https://gofile.io/d/leCtNM Fair Reflection Test: https://docs.google.com/spreadsheets/d/1uMaoCdoGbNpm25fODpgnM6T497r8QQoWP0UJ9Az6uEY/edit?usp=sharing Unfair Reflection Test https://docs.google.com/spreadsheets/d/1Q3xczUxTAw3CCzrviZyitNplwxbPCMGohKzB4t5tUe4/edit?usp=sharing ... https://www.youtube.com/watch?v=GCrmX2Aq70Y

Healing blind for two minutes when the sun rose and blocked all vision of my monitor. ... https://www.youtube.com/watch?v=rfOwjrj9mnk

Music Horns of Erebor Basic Michigan Alg; f(x) = reflection line; z(x) = proportion of Mail-ins to Election Day Votes, 2000 MiV votes to 1000 EDV votes means z(x) = 2 b1(x) = Biden EDV%; t2(x) = TrumpMIV % b2(x) = Biden Miv%; t1(x) = Trump EDV% The algorithm solves as t2 as a function of b1. (t1 is implied by b1, regardless of whether or not the election is or isn't fair, since t1 is always equal to 100%-b1). (b2 is implied by t1, regardless of whether or not the election is or isn't fair, since b2 is always equal to 100%-t1). a(x) = Biden's Aggregate Percentage for the entire precinct. Since b1(x), b2(x), t1(x), t2(x) and a(x) are all forced, one only needs the reflection constant and lambda and the predetermined aggregate a(x) to generate both candidates percentages for both the MiV and EDV. The intersection of the line x = k, (k bounded from 0 to 1) with all five percentage functions are the percentages of the candidate's. If a desired value of a(x) exists between 0% and 100% from x bounded from 0 to 1, then the algorithm simply reads the values of the functions b1(x), b2(x), t1(x) and t2(x) and multiples those percentages against the respective vote totals and generates the Tabulation Record. If a(x) does not exist, either the proportion z(x) must be increased, or the reflection line f(x) must be decreased. We note that at z(x) = 3 and f(x) = 0.25, that a(x) cannot drop below 50%, guaranteeing a victory for the candidate, even if they get 0% of the election day vote; thus one only requires a 3:1 ratio of MiV ballots to EDV ballots to guarantee a victory at the precinct, since if b1(x) = 0% EDV then b2(x) = 66.667%, MIV therefore the aggregate of 0% and 66.667% at a ratio of 3 MIV to 1 EDV ballot is an aggregate that exceeds 50%. https://www.desmos.com/calculator/8ibu8ydios Macomb County Recorder Website: https://electionresults.macombgov.org/m31/results.html Thesis Paper: https://docs.google.com/document/d/1Jj9ASctIWDhcpesR8d3r-qj9Ez6uxIIsFfxgkuNJgZE/edit?usp=sharing Source Video for the Derivation: https://www.youtube.com/watch?v=C5o2kUjevUA Michigan Engine (link is safe ignore warning): https://gofile.io/d/leCtNM ... https://www.youtube.com/watch?v=Th6Bd08qbSk