The problem is asking to find c given that- c ≡ 13a(mod19) and the variable a ≡ 11 (mod19).

Parker Bird 2022-07-17 Answered
The problem is asking to find c given that-
c 13 a ( mod 19 ) and the variable a 11 ( mod 19 ).
I've tried to solve this using algebra and using the theorems but I can't seem to work it out.
Any suggestions?
You can still ask an expert for help

Want to know more about Discrete math?

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

wintern90
Answered 2022-07-18 Author has 12 answers
Step 1
Well, there's no problem: c 13 × 11 = 143 10 ( mod 19 ) .
Step 2
Thus c = 10 + 19 k , k Z . The only solution between 0 and 18 is for k = 0, i.e. c = 10

We have step-by-step solutions for your answer!

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2020-11-09
Use proof by Contradiction to prove that the sum of an irrational number and a rational number is irrational.
asked 2021-08-18
Discrete Mathematics Basics
1) Determine whether the relation R on the set of all Web pages is reflexive, symmetric, antisymmetric, and/or transitive, where (a,b)R if and only if
I) everyone who has visited Web page a has also visited Web page b.
II) there are no common links found on both Web page a and Web page b.
III) there is at least one common link on Web page a and Web page b.
asked 2021-08-15
How many elements are in the set { 0, { { 0 } }?
asked 2021-08-02
Suppose that A is the set of sophomores at your school and B is the set of students in discrete mathematics at your school. Express each of these sets in terms of A and B.
a) the set of sophomores taking discrete mathematics in your school
b) the set of sophomores at your school who are not taking discrete mathematics
c) the set of students at your school who either are sophomores or are taking discrete mathematics
Use these symbols:
asked 2022-09-06
x + 1 2 = 2 x + 1 3
I want to find the solutions in R of x + 1 2 = 2 x + 1 3 , where ⌊x⌋ is the unique integer such that x x < x + 1.
I solved it as follows. Let x + 1 2 = n. By the definition, n x + 1 2 < n + 1. Then 2 n 1 x < 2 n + 1, 4 n 2 2 x < 4 n + 2, 4 n 1 2 x + 1 < 4 n + 3, and finally, 4 n 3 1 3 2 x + 1 3 < 4 n 3 + 1. (1).
Now I analyzise n modulo 3.
If n = 3 k, then (1) becomes 4 k 1 3 2 x + 1 3 < 4 k + 1. Then either 2 x + 1 3 = 4 k 1, or 2 x + 1 3 = 4 k. From the equation itself, it follows that 3 k = 4 k 1, or 3 k = 4 k, so k = 0 or k = 1. It's easy to turn this into 2 intervals for x.
Similarly, I can continue for 3 k + 1 and 3 k + 2. This seems to lead to a solution, but is there perhaps a better way? Thank you for any ideas/verification of my solution.
asked 2021-08-03
Determine whether each statement is true or false. For each true statement, give a direct proof as justication. For each false statement, give a counterexample as justification.(discrete math)
i) If x + y is an even integer, then x and y are both even integers.
ii) If x2=y2, then x=y.
iii) The mean1 of two even numbers is even.
iv) If x and y are even integers, then x + y is an even integer.
asked 2022-09-06
Is each graph a subdivision of itself? On proving reflexivity of the topological minor relation.
The minor relation and the topological-minor relation are partial orderings on the class of finite graphs, i.e. they are reflexive, antisymmetric and transitive
I proved the three properties for the minor relation but am confused when it comes to the topological-minor relation and proving that it is reflexive. Diestel does not really define if a graph G is counted as a subdividing itself, i.e. having an empty set of subdividing vertices and reading the definition on Proof Wiki sounds like one has to at least subdivide one edge resulting in a non-isomorphic graph G′ such that G′ is the smallest subdivision of G.
However, to prove reflexivity, i.e. G being a topological minor of G, G must be in the set of subdividing graphs TX. This is due to the fact that the topolocical minor relation is defined as follows: X is a topological minor of Y if there exists a subdivision of X, which is a subgraph of Y. Therefore, if G T X because G′ is the smallest subdivision of G. Then, no graph in TX can be a subgraph of G and hence, G can't be its own topological minor.
Am I misunderstanding how to prove the reflexivity of a topological minor or something in its definition?

New questions

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question