i went to post office to take my opengl book in noon (since my door bell is broken, posts get diverted to branch offices in vicinity), hmm then turned out i could take tomorrow. anyway, at least learnt place of it. yayy my opengl 4.5 book is to be present on tomorrow:) (i thoguht it were gl4.6:D turned out i wrongly bought 4.5 one. or maybe 4.6 is not published yet, i dont any know)
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