From 26ca3e426be994a475d9e39eb002190043d69093 Mon Sep 17 00:00:00 2001
From: Cassandra Masschelein
 <49848281+cassmasschelein@users.noreply.github.com>
Date: Fri, 8 Mar 2024 11:55:41 -0500
Subject: [PATCH] Update README.md

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

diff --git a/README.md b/README.md
index 2376e27..cf999c1 100644
--- a/README.md
+++ b/README.md
@@ -10,7 +10,7 @@ The permanent of a (square) matrix, like the determinant is a polynomial in the
 
 The permanent commonly appears in problems related to quantum mechanics, and the most common brute-force combinatorial method has time complexity $\mathcal{O}(N!N)$, thus it is useful to look for more efficient algorithms. The two algorithms considered to be the fastest are one by Ryser (based on the inclusion-exclusion principle), and one by Glynn (based on invariant theory).
 
-This library aims to solve the need for an efficient library that solves the permenent of a given matrix.
+This library aims to solve the need for an efficient library that solves the permenent of any given matrix.
 
 # Algorithms