Skip to content

Commit 07ba139

Browse files
authored
Update README.md
1 parent a3d609d commit 07ba139

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ These primality tests fail for certain numbers called **pseudoprimes**.\
88
My research focuses on analyzing the class of Perrin-type primality tests- **Lucas-Type Sequence**:
99

1010
## [Lucas-Type Sequence](https://oeis.org/wiki/Lucas_sequences)
11-
Each primality test is a sequence with two parameters$$c_0, c_1$$
11+
Each primality test is a sequence with two parameters: $$c_0, c_1$$
1212
$$V_{n+2} = c_1 V_{n+1} + c_0 V_{n}, \quad V_{0} = 2, \quad V_{1} = c_1$$
1313

1414
If p is prime, then we have the congruence $$V_{p}\equiv V_{1}(mod\quad p)$$

0 commit comments

Comments
 (0)