Consider the RSA algorithm as described in Figure 9.5 of the notes, with public key PU = {e,n}. Suppose that somehow you found out the value for(n):

e= 65537

n= 22362386726138135647

(n) = 22362386716581594696

Show that you understand the use of the quadratic general formula to find the prime factors ofn, by entering the numerical values ofa,b, andcaccording to the general formula below:

x=b+b24ac2a

Enter the numerical values fora,b, andc. For example, ifa=3,b=2,c=1, enter"a=3,b=2,c=1".