From 017bee65bfa0ec2bcce89d71dec6d7b5363f182d Mon Sep 17 00:00:00 2001
From: zleyyij <75810274+zleyyij@users.noreply.github.com>
Date: Thu, 1 Aug 2024 15:57:07 -0600
Subject: [PATCH] vault backup: 2024-08-01 15:57:07

---
 notes/ANS Theory.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/notes/ANS Theory.md b/notes/ANS Theory.md
index b3048ab..a65badb 100644
--- a/notes/ANS Theory.md	
+++ b/notes/ANS Theory.md	
@@ -8,4 +8,4 @@ ANS theory is based around the idea that digits that occur more often can be sto
 
 Taking a look at the standard binary numeral system, there are two digits in the set (0 and 1). Given a natural number represented in binary, eg `1010`, there are two different ways to *add information to that number*:
 1. We can add a digit to the most significant position. As an example, adding a `1` to the above value would result in `11010`. Doing this means that the added digit stores information about *large ranges*. In the provided example, this means that setting that digit changes the value by 16.
-2. We can add a digit to the least significant position. As an example, adding a `1` to the above value would result in `10101`. Changing the added digit will only change the value by 16.
+2. We can add a digit to the least significant position. As an example, adding a `1` to the above value would result in `10101`. Changing the added digit will only change the resulting natural number by 1.