Testing new workflow

Author: jagdish-15

exercises/practice/affine-cipher/.docs/instructions.md

@@ -18,11 +18,6 @@ E(x) = (ai + b) mod m
 
 Where:
 
-- `i` is the letter's index from `0` to the length of the alphabet - 1.
-- `m` is the length of the alphabet.
-  For the Latin alphabet `m` is `26`.
-- `a` and `b` are integers which make up the encryption key.
-
 Values `a` and `m` must be _coprime_ (or, _relatively prime_) for automatic decryption to succeed, i.e., they have number `1` as their only common factor (more information can be found in the [Wikipedia article about coprime integers][coprime-integers]).
 In case `a` is not coprime to `m`, your program should indicate that this is an error.
 Otherwise it should encrypt or decrypt with the provided key.