this a discrete structures p poroblem find an integer solution to 13x +17y =1 use the...

Question

Question

this a discrete structures p
poroblem

find an integer solution to 13x +17y =1
use the solution to solve 13x = 15 mod 17

engineering Computer-Science

Answer 1

Answer #1

Answer 2

Similar Homework Help Questions

please help！！！ Discrete Structures For each of the following congruences if there is a solution, express...

please help！！！ Discrete Structures For each of the following congruences if there is a solution, express the solution in the form x ≡ some_number (mod some_modulus), e.g. x ≡ 6 (mod 9). To standardize answers, some_number should always be a value in the range {0, 1, 2, ..., some_modulus -1}. For example x ≡ 5 (mod 8) is OK but x ≡ 13 (mod 8) is not. If there is no solution say "No solution". You don't have to show work for any...
1. Find the general solution of the Euler eq. 4x’y" +17y=0, x>0.

1. Find the general solution of the Euler eq. 4x’y" +17y=0, x>0.
(5 points) Find the general solution to the differential equation y" – 2y + 17y=0. In...

(5 points) Find the general solution to the differential equation y" – 2y + 17y=0. In your answer, use Cį and C2 to denote arbitrary constants and t the independent variable. Enter Cų as C1 and C2 as С2. y(t) = help (formulas) Find the unique solution that satisfies the initial conditions: y(0) = -1, y'(0) = 7. y(t) =

(1 point) Find the smallest positive integer solution to the following system of congruence: x =...

(1 point) Find the smallest positive integer solution to the following system of congruence: x = 5 (mod 19) = 2 (mod 5) = 7 (mod 11) x =
Discrete structure For each of the following congruences if there is a solution, express the solution...

Discrete structure For each of the following congruences if there is a solution, express the solution in the form x ≡ some_number (mod some_modulus), e.g. x ≡ 6 (mod 9). To standardize answers, some_number should always be a value in the range {0, 1, 2, ..., some_modulus -1}. For example x ≡ 5 (mod 8) is OK but x ≡ 13 (mod 8) is not. If there is no solution say "No solution". You don't have to show work for any of the...
Discrete 4. Consider the cryptosystem in which the integer I associated with a letter is transformed...

Discrete 4. Consider the cryptosystem in which the integer I associated with a letter is transformed into f(x) = 4.c mod 26. (a) Find the function f-1(2) that will decrpt. (b) Into which secret word is the word DISCRETE transformed? (c) Which word is transformed into the secret word FOYN?

Solve the equation x3 – 13x² +47x-35 = 0 given that 1 is a zero of...

Solve the equation x3 – 13x² +47x-35 = 0 given that 1 is a zero of f(x) = x3 – 13x² +47x-35. The solution set is {}. (Use a comma to separate answers as needed.)
Given 2 as a primitive root of 29, construct a table of discrete logarithms, and use it to solve ...

Given 2 as a primitive root of 29, construct a table of discrete logarithms, and use it to solve the following congruences b. x2− 4x − 16 ≡ 0(mod 29) c. x7≡ 17(mod 29) I need step by step calculations for b and c
Discrete Math. Use modular exponentiation to find 250 mod 13.

Discrete Math. Use modular exponentiation to find 250 mod 13.

Please answer the following two questions. Find the smallest positive integer solution to the equation. Show...

Please answer the following two questions. Find the smallest positive integer solution to the equation. Show all of your work. x = 4 mod 7 Find the smallest positive integer solution to the equation. Show all of your work. x5 = 11 mod 35