we could think of the dot product as rectangles of height norm of vectors like a histogram be convolved with another histogram right? so for sure if we did fourier like magic to this, to change its lod, it would give similar result. so i think changing lod of along with SH or fourier is something to be investigated for its compression with lod capability considering its convolution stuff. for to do SVD similar acts. i think it feels legit to try. though the problem is we need to multiply at least similar count of times or more to get simplifications. so rather it would be nice to
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