What Are Bit Strings?

The transcript used in this video was heavily influenced by Dr. Oscar Levin's free open-access textbook: Discrete Mathematics: An Open Introduction. Please visit his website to get the full textbook for free: discrete.openmathbooks.org/dmo...
Prerequisites: (This will be updated soon!)
Hi! My name is Kody Amour, and I make free math videos on KZbin. My goal is to provide free open-access online college math lecture series on KZbin using free open-access resources. I rely on generous donations and ad revenue - a special thanks to everyone who helped this channel grow.
**Please only give if you have the financial ability to do so.**
Support this Amour Learning channel directly on Patreon: / amourlearning
-------------------------------------------------------------------------------------------------------------------
Credit to all of the authors of all of the resources below that greatly helped influence this video. My newer videos are much more original than these videos.
Free open-access online math textbooks:
aimath.org/textbooks/approved...
My favorite number theory textbooks:
Number Theory: In Context and Interactive by Dr. Karl-Dieter Crisman: math.gordon.edu/ntic/
Elementary Number Theory:
Primes, Congruences, and Secrets by Dr. William Stein: wstein.org/ent/
A Computational Introduction to Number Theory and Algebra by Dr. Victor Shoup: shoup.net/ntb/
My favorite programming language:
SageMath (which in my view is categorically more productive than Python, R, Mathematica, Matlab, Maple, Magma, etc - if you're using any of these and they aren't working out, consider switching to Sage): www.sagemath.org/
A free in-depth tutorial for SageMath: doc.sagemath.org/html/en/tuto...
Learn LaTeX in 30 minutes: www.overleaf.com/learn/latex/...
-------------------------------------------------------------------------------------------------------------------
My favorite math/science KZbin channels that I absolutely love (in no particular order):
Zach Star: / @zachstar
Numberphile: / @numberphile
3Blue1Brown: / @3blue1brown
MIT OpenCourseWare: / @mitocw
Khan Academy: / @khanacademy
PBS Infinite Series: / @pbsinfiniteseries
Lex Fridman: / lexfridman

[@sandeepmukherjee8927]

This video should deserve more 👍es

[@Tszchow]

Thank you😊

[@taregajulliahjennl.3092]

9:06

[@AnaBautista-ft1jt]

But why do you know the question asks you exactly in B length 3 and weight 2 that they. ask you for at least two are one? why can no be two ceros?

[@taregajulliahjennl.3092]

9:06 But wait -32 and 10 were the answers to the counting questions about subsets. Coincidence? Not at all. Each bit string can be thought of as a code for a subset. To represent the subsets of A = { 1 , 2 , 3 , 4 , 5 } , we can use 5-bit strings, one bit for each element of A . Each bit in the string is a 0 if its corresponding element of A is not in the subset, and a 1 if the element of A is in the subset. Remember, deciding the subset amounted to a sequence of five yes/no votes for the elements of A . Instead of yes, we put a 1; instead of no, we put a 0.

[@ernaniandrade7892]

Thx man!

[@imran7TW]

thx boss