From b31c56aefac0d4bb3e613ab4bcb186f13ca01f5d Mon Sep 17 00:00:00 2001
From: Krishnan Sanjay
Date: Fri, 3 May 2019 19:46:14 -0500
Subject: [PATCH] Update README.md
---
hw2/README.md | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/hw2/README.md b/hw2/README.md
index 9a702c2..cb730ba 100644
--- a/hw2/README.md
+++ b/hw2/README.md
@@ -86,7 +86,7 @@ Find the number of unique cities in the hometown table that don't have any stude
For each city find the student with the highest GPA (including ties). Return the names of those students who are the best in their respective cities only if there are at least 8 students from the city. Your result should have a single column `name` with the students' names.
### 7.sql
-Calculate the probability (as a fraction) that two randomly picked students will be from the same city and same county. Your result should have two columns (`numerator`) and (`denominator`) representing this fraction and a single row. You may not hard code any sizes.
+Calculate the probability (as a fraction) that two randomly picked students will be from the same city. Your result should have two columns (`numerator`) and (`denominator`) representing this fraction and a single row. You may not hard code any sizes.
## Submission
After you finish the assignment you can submit your code with:
--
libgit2 0.25.0