{"version":9,"randomSeed":"8aa9461d0cff473018c17dc796154bfe","graph":{"viewport":{"xmin":-175.00294281216767,"ymin":-20.404425269549563,"xmax":450.84615331732084,"ymax":92.42463602773944},"squareAxes":false},"expressions":{"list":[{"type":"expression","id":"1","color":"#c74440","latex":"B\\left(n,i\\right)=\\operatorname{mod}\\left(\\operatorname{floor}\\left(\\frac{n}{2^{i}}\\right),2\\right)"},{"type":"expression","id":"3","color":"#388c46","latex":"B_{a}\\left(n\\right)=\\left[B\\left(n,i\\right)\\operatorname{for}i=\\left[0...\\operatorname{ceil}\\left(\\log_{2}\\left(n\\right)\\right)-1\\right]\\right]"},{"type":"text","id":"7","text":"does n (number as bitstring) contain k (number as bitstring), of length l?"},{"type":"expression","id":"2","color":"#2d70b3","latex":"C_{S}\\left(n,k,l\\right)=1-\\prod_{i=0}^{\\operatorname{floor}\\left(\\log_{2}\\left(n\\right)\\right)+1-l}\\left(1-\\prod_{j=0}^{l-1}\\left\\{B\\left(n,i+j\\right)=B\\left(k,j\\right):1,0\\right\\}\\right)"},{"type":"expression","id":"5","color":"#c74440","latex":"\\left[\\left(v,\\sum_{L=1}^{12}\\sum_{u=0}^{2^{L}-1}C_{S}\\left(v,u,L\\right)\\right)\\operatorname{for}v=\\left[1...1000\\right]\\right]"},{"type":"expression","id":"16","color":"#2d70b3","latex":"x=2^{\\left[1...10\\right]}-\\frac{1}{2}"},{"type":"expression","id":"20","color":"#000000","latex":"y=34"},{"type":"expression","id":"15","color":"#000000","latex":"2=10"},{"type":"expression","id":"11","color":"#c74440","latex":"19=10011"},{"type":"expression","id":"12","color":"#2d70b3","latex":"558=1000101110"},{"type":"expression","id":"14","color":"#6042a6","latex":"\\sum_{u=0}^{15}C_{S}\\left(272060,u,4\\right)"}]}}