Ôîðóì » Ëîãè÷åñêèå âûðàæåíèÿ » -What is interesting in the work of E.A.Mironchik "Solving problems EGE-18 with per bit operations " » Îòâåòèòü
-What is interesting in the work of E.A.Mironchik "Solving problems EGE-18 with per bit operations "
dbaxps: https://informatics-ege.blogspot.com/2018/11/what-is-interesting-in-work-of-ea.html ****************************** UPDATE as of 24/11/2018 ****************************** Treat problem 5 from original manuscript http://kpolyakov.spb.ru/download/mea18bit.pdf with Bitwise2 (x&26 ¬=10 ) = ¬Z(16) + Z(8) + Z(2) (x&27 = 11 ) = Z(16)*¬Z(8)*¬Z(2)*¬Z(1) ¬Z(16) + Z(8) + Z(2) + Z(16)*¬Z(8)*¬Z(2)*¬Z(1) + A = 1 ¬Z(16) + Z(8) + Z(2) + ¬Z(1) + A = 1 ¬(Z(16)*Z(1)) + Z(8) + Z(2) + A = 1 Z(16 OR 1) => Z(8) + Z(2) + A = 1 (Z(17)=> A) + (Z(17)=>Z(8)) + (Z(17)=>Z(2)) = 1 Z(17) => A = 1 Thus A(max) = 17 ###################### UPDATE as of 05/12/2018 ###################### Following lines must be removed from blog due to explanation provided by Helen Mironchick which allowed me start to understand her original idea properly. # In particular case for any (n: n mod 2 = 0) E(n+1) = E(n) + E(1) , # what actually seems to be enough to reproduce a bunch of samples # kind of printed above as well as in original manuscript # However, E(36) != E(35) + E(1) so we are getting obvious restriction # for method ( approach ) If it doesn't violate site's regulations or policy ,please, open for public-
Îòâåòîâ - 0
ïîëíàÿ âåðñèÿ ñòðàíèöû