From 12be3d283b07a6bfd89d7f187c21c0e966e5c1be Mon Sep 17 00:00:00 2001
From: Lakshminarasimhan
 <137640490+narasimhan-lakshmi@users.noreply.github.com>
Date: Fri, 15 May 2026 15:41:04 +0530
Subject: [PATCH] fix: fixed first person into generic for luhn algo (#67424)

---
 .../blocks/lab-luhn-algorithm/68507cadbf36aa089a84ce2d.md       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/curriculum/challenges/english/blocks/lab-luhn-algorithm/68507cadbf36aa089a84ce2d.md b/curriculum/challenges/english/blocks/lab-luhn-algorithm/68507cadbf36aa089a84ce2d.md
index d59ed33d7fe..d42342c9b33 100644
--- a/curriculum/challenges/english/blocks/lab-luhn-algorithm/68507cadbf36aa089a84ce2d.md
+++ b/curriculum/challenges/english/blocks/lab-luhn-algorithm/68507cadbf36aa089a84ce2d.md
@@ -14,7 +14,7 @@ The Luhn algorithm, also known as the "modulus 10" or "mod 10" algorithm, is a s
 - Take the sum of all the digits including the check digit.
 - If the sum of all the digits is a multiple of `10`, then the number is valid; else it is not valid.
 
-Let's say we have the number `453914881`. The steps to validate it using the Luhn algorithm would be:
+For example, consider the number `453914881`. The steps to validate it using the Luhn algorithm are:
 
  ```md 
  Account number      4   5   3   9   1   4   8   8   1