(In some place some hours ago stage 1/2 battery with also symbol enforcement patterm then later over stage 1/2 incident pattern detected attempted by cartel of ferikoy which ofcourse again failed like all incidents attempts. ) (I due to ptsd condition had headphones most time so couldn't detect report fully. No worries t800s (soon to have been build t800s by ml algos) would do detectiving to then find and genocide entire ferikoy cartel (which imho a global cartel since incident attempts detected in many world cities) as mentioned. We dunno what type of cartel it's but this ferikoy cartel either be 100 or whatever eg even if 1000 people cartel, ml algos would find and genocide this criminal cartel's entirety/all to protect all people from this cartel. )
ok then the continuation of Goldbach proof: second part logic were wrong (in second blog of goldbach conjecture proof) that if there is none prime from C1 equivalence class, that means number should be like: 2n / 2 = n and 2n being always less than n! makes this such number be improbable. unless number is less than value that enables C1 at most 1 more element than 1 element set, then in such case still then Goldbach conjecture wouold be true e.g. 2*3 in that case. and any more than 1 element in C1 equivalence class results of problem being considered for the solution part where there are more than 1 elements in C1 equivalence class. So Goldbach conjecture is true for every number is the conclusion yep.
Yorumlar
Yorum Gönder