Update algorithms/dynamic_programming/countingbits/README.md

Co-authored-by: coderabbitai[bot] <136622811+coderabbitai[bot]@users.noreply.github.com>

Author: BrianLusina

algorithms/dynamic_programming/countingbits/README.md

@@ -51,9 +51,7 @@ When the number is odd,
 - rightmost bit = 1
 - rest of bits = 10, which is also (5 // 2) = 2 in binary.
 
-in the binary representation of i is that number plus 1 if the rightmost bit is 1. We can tell if the last significant
-bit is 1 by checking if it is odd.
-
+The number of 1's in the binary representation of i is the count from i // 2 plus 1 if the rightmost bit is 1. We can tell if the least significant bit is 1 by checking if the number is odd.
 As an example, we know that the number of 1's in 2 is 1. This information can be used to calculate the number of 1's in 4.
 The number of 1's in 4 is the number of 1's in 2 plus 0, because 4 is even.