From af8d52092232e1104154b733000716036e668444 Mon Sep 17 00:00:00 2001
From: Roberto Garcia <37519995+rga2@users.noreply.github.com>
Date: Wed, 14 Dec 2022 22:10:09 -0600
Subject: [PATCH] Update is_even.py (#8028)

---
 bit_manipulation/is_even.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/bit_manipulation/is_even.py b/bit_manipulation/is_even.py
index b7b0841a1..ba036f35a 100644
--- a/bit_manipulation/is_even.py
+++ b/bit_manipulation/is_even.py
@@ -11,7 +11,7 @@ def is_even(number: int) -> bool:
     from the above examples we can observe that
     for all the odd integers there is always 1 set bit at the end
     also, 1 in binary can be represented as 001, 00001, or 0000001
-    so for any odd integer n => n&1 is always equlas 1 else the integer is even
+    so for any odd integer n => n&1 is always equals 1 else the integer is even
 
     >>> is_even(1)
     False