From 100efdb6b3fdb16ee6cf2692f8b9d7b83443d327 Mon Sep 17 00:00:00 2001
From: pavl_g <60224159+Scrappers-glitch@users.noreply.github.com>
Date: Fri, 10 May 2024 17:01:40 +0100
Subject: [PATCH] Update appendix-a.md

---
 discrete-maths/appendix-a.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/discrete-maths/appendix-a.md b/discrete-maths/appendix-a.md
index d3e0ab3..2c1d7c7 100644
--- a/discrete-maths/appendix-a.md
+++ b/discrete-maths/appendix-a.md
@@ -18,6 +18,6 @@ $$C_c = N_c * \sum_{n=1}^N {\tau}\_n$$
 
 - Such that, ${\tau}\_n = C'_c$, and ${\{\tau\}\'\}\_n = {C^{''}}_c$, and so on; as it represents the transition between machinery states, so this is a recursive formula re-evaluating on the most inner closures.
 
-$$Then, C_c = \prod_{i=1}^I E_{e_i} * \sum_{n=0}^N {\tau}\_n = (E_{e_1} * E_{e_2} * ... * E_{e_{I-1}} * E_{e_{I}}) * ({\tau}\_{1} + {\tau}\_{2}  + ... + {\tau}\_{(N-1)}\ + {\tau}\_{(N)}\)$$
+$$Then, C_c = \prod_{i=1}^I E_{e_i} * \sum_{n=0}^N {\tau}\_n = (E_{e_1} * E_{e_2} * ... * E_{e_{I-1}} * E_{e_{I}}) * ({\tau}\_{1} + {\tau}\_{2}  + ... + {\tau}\_{(N-1)} + {\tau}\_{(N)})$$
 
 $$And, t_c = (C_c/F_{CPU}) + {\epsilon}$$