Update src/algebra/bit-manipulation.md

ganeshvarbalaji · adamant-pwn · web-flow · commit 0db2c965d8d1 · 2024-06-18T21:20:00.000+05:30
Co-authored-by: Oleksandr Kulkov &lt;adamant.pwn@gmail.com&gt;
diff --git a/src/algebra/bit-manipulation.md b/src/algebra/bit-manipulation.md
@@ -207,7 +207,7 @@ We can see that the all the columns except the leftmost have $4$ (i.e. $2^2$) se
 With the new knowledge in hand we can come up with the following algorithm:
 
 - Find the highest power of $2$ that is lesser than or equal to the given number. Let this number be $x$.
-- Calculate the number of set bits from $1$ to $2^x - 1$ by using the formua $x*(2^{x-1})$.
+- Calculate the number of set bits from $1$ to $2^x - 1$ by using the formua $x \cdot 2^{x-1}$.
 
 The next steps needs more explanation.
 - Count the no. of set bits in the most significant bit from $2^x$ to $n$ and add it.
