Foundations of matematics question need help solving. Q1. Consider the Diophantine equation (i). Use Euclid's Algorithm...
Use C++ forehand e receiver creates a public key and a secret key as follows. Generate two distinct primes, p andq. Since they can be used to generate the secret key, they must be kept hidden. Let n-pg, phi(n) ((p-1)*(q-1) Select an integer e such that gcd(e, (p-100g-1))-1. The public key is the pair (e,n). This should be distributed widely. Compute d such that d-l(mod (p-1)(q-1). This can be done using the pulverizer. The secret key is the pair (d.n)....
I need help with these! 3. (1 point) a) Compute the general solution of the differential equation y"5 12y" 0 b) Determine the test function Y (t) with the fewest terms to be used to obtain a particular solution of the following equation via the method if undetermined coefficients. Do not attempt to determine the coefficients.5y 12y"2 10e-tesin(V3t) Spring 2011) 4. (1 point) Compute the general solution of the following differential equations dz dy dt ii)(1y iv) (z cos(y) +...