diff --git a/Concurrent Systems/notes/3.md b/Concurrent Systems/notes/3.md
index d9e82c7..1978515 100644
--- a/Concurrent Systems/notes/3.md	
+++ b/Concurrent Systems/notes/3.md	
@@ -189,7 +189,7 @@ By contradiction, assume that there is a lock but nobody enters its CS
 		- if $p_j$ is in the bakery, by assumption `⟨MY_TURN[i] , i⟩ < ⟨MY_TURN[j] , j⟩` since it is the minimum.
 
 #### Bounded bypass proof (bound n-1)
-Let $p_i$ and $p_i$ competing for the CS and $p_j$ wins
+Let $p_i$ and $p_j$ competing for the CS and $p_j$ wins
 
 Then, $p_j$ enters its CS, completes it, unlocks and then invokes lock again
 - If $p_j$ has entered the CS, √