5
EdwardSolomon 5 points ago +5 / -0

I've given lecture and seminars on the subject of Andrica Conjecture. Like Andrew Wiles, I have to present that proof over the course of seminars as he did for Fermat.

It's been nearly a decade's long study.

Another man named Kim Lumbard actually tried to steal my work in 2014 and published it in a journal and its a caused a clusterfuck and he was forced retract it.

53
EdwardSolomon 53 points ago +53 / -0

I don't deal with statistics and possible hidden variables.

I deal with discrete integers and geometric proofs.

I welcome the globalist scum to fight Euler's Sum of the Inverse Squares and disprove his famous 1735 theorem concerning the count of irreducible integer ratios.

16
EdwardSolomon 16 points ago +17 / -1

Literally.

The only way I know these statements reach them is when they call me personally or publicly acknowledge or I see it in the courts.

18
EdwardSolomon 18 points ago +18 / -0

Yes.

My skillset is mathematics however, not physical forensic auditing of ballots.

I can prove "what" happened (electronically), "where" it happened (precincts names/locations) and "when" it happened (timestamps); I can't prove "who" did it, "why" they did or "how" they did with the physical ballots themselves.

I can only pray that the investigators with such knowledge go to the precincts that I identified.

34
EdwardSolomon 34 points ago +34 / -0

Also, "The Wheel," is not an analogy to explain the results.

The Wheel IS the result.

They used vector addition aided by modular arithmetic (modular arithmetic = wheel) to keep the average balanced at the desired outcome.

70
EdwardSolomon 70 points ago +70 / -0

Yes, hundreds of coders, scripters, IT professionals and hackers in my Youtube channel, verifying every step of the process that I live streamed over six days.

43
EdwardSolomon 43 points ago +43 / -0

I can't do better than 6 day live stream, averaging 14 hours per day, with full documentation in the Readme files for each spreadsheet.

All the coders, hackers, IT professionals in my channel chat understood everything and even simplied half of my scripts and column formulas.

I'm pretty sure they all know how to do it faster than I can now.

5
EdwardSolomon 5 points ago +5 / -0

Yes, it's called Euler's Sum of Inverses Squares, rapidly converging on pi^2/6; which is why the count of dicsrete integer ratios converges on 3x^2/pi^2; making the change of these ratio transfers between precincts less than (1/6000)^n, where n is the number of precincts that simultaneously absorb the ratio.

In other words, the chances are effectively zero.

Good day.

5
EdwardSolomon 5 points ago +5 / -0

I did this under the continuous watch of coders, hackers and IT specialists on live stream for six days straight.

7
EdwardSolomon 7 points ago +7 / -0

I'm convinced all the hijacked votes were ballots that would never have been cast, they were either manufactured behorehand or blank.

Worst case scenario is your result, at 22,842.

5
EdwardSolomon 5 points ago +5 / -0

It's an alternating harmonic sum of which irreducible fractions can transpose into the margin.

I should ahve prefaced the example in the video by saying, "If some state gets a(x/y) , such that x/y cannot be reduced, ratios, what are the chances of another state getting a b(x/y), such that a,b are integer multiples of the (x/y) ratios.

5
EdwardSolomon 5 points ago +5 / -0

Ok, so explain how I found a solution to a reverse floor function (wheel number that was equal to 2231) and then proved that the algorithm started with equal weight on each ratio (same number of total votes per hijacked precinct) and used simple vector addition to move the weights and maintain the same average.

view more: ‹ Prev Next ›