Decrypting... (Problem 1 )

My formula used in this problem is: $\frac{(n_1 * n_2)/x^y}{highest factor^z}$ = b shift where: $n_1$ and $n_2$ = random integers (except negative integers), x = highest possible divisor, y = highest possible power before $n_1 * n_2$ turns into fraction (or $y_1$ ), z = highest power possible (or $y_2$ ) and shift = encryption shift. I encrypt in three stages: 1st stage: encrypt each letter using $\frac{n_1 * n_2}{x^y}$ and subtract any number >= 1 - afterwards I divide like this: $\frac{62}{ denominator of shift}$ (if the shift is like $\frac{3}{34}$ , I do: $\frac{62}{ denominator of shift}$ * numerator of shift.) After that, I round the result to an integer and encrypt by that integer (if the letter is the same, I use that encrypted letter for that letter (i.e queen and encryption is azjjr, e = j (both of them)). 2nd stage: I add the encrypted letters according to their place in the normal alphabet (since I change $n_1$ and $n_2$ every time, I cannot create a sheet where each letter is specific to an encrypted letter: it depends on $n_1$ and $n_2$ .) and create a number. 3rd stage: I divide that number by $highest factor^z$ (highest factor is any factor apart from itself and 1.) and whatever number comes out, I correspond it to the alphabet and the letter (or letters) is the final encrypted mesage.