From b39431db8e78e56ffedef6639439a842fba6094a Mon Sep 17 00:00:00 2001
From: Callum Turino <63823484+crt26@users.noreply.github.com>
Date: Mon, 27 Jan 2025 12:01:07 +0000
Subject: [PATCH] Update to Lab 1 README

---
 unit01_cipher_fundamentals/lab/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/unit01_cipher_fundamentals/lab/README.md b/unit01_cipher_fundamentals/lab/README.md
index 5578ea3..0591041 100644
--- a/unit01_cipher_fundamentals/lab/README.md
+++ b/unit01_cipher_fundamentals/lab/README.md
@@ -191,7 +191,7 @@ Result = value<sup>x</sup> mod (prime number)
 
 For example, if we have a prime number of 269, and a value of 8 with an x value of 5, the result of this operation will be:
 
-Result = 85 mod 269 = 219
+Result = 8<sup>5</sup> mod 269 = 219
 
 With prime numbers, if we know the result, it is difficult to find the value of x even though we have the other values, as many values of x can produce the same result. It is this feature which makes it difficult to determine a secret value (in this case the secret is x).