1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
SOVA2 [1]
2 years ago
10

Which transformation can NOT be used to prove that ABC is congruent to DEF?

Mathematics
2 answers:
Murrr4er [49]2 years ago
8 0

Answer:dialation

Step-by-step explanation:

Alexxx [7]2 years ago
7 0

Answer: it is dilation

Step-by-step explanation: i took the exam

You might be interested in
Find the solution to the system of equations.
Vikentia [17]

Answer:

C

Step-by-step explanation:

4 0
3 years ago
I really need help Can someone help me
denis-greek [22]
The answer is 3.800 because you round up
6 0
3 years ago
Please help and thank you
Anna11 [10]
2 servings because one serving is 4%, so you would need would need to double that, or multiply it by two.
3 0
3 years ago
-10x = -210 how would i find this answer?
jeka94

To find the answer to -10x=-210 you must divide -210 by -10

-210/-10= 21

Therefore x=21

So the proper equation is -10(21)=-210

3 0
2 years ago
Read 2 more answers
What is the smallest integer $n$, greater than $1$, such that $n^{-1}\pmod{130}$ and $n^{-1}\pmod{231}$ are both defined?
olasank [31]

First of all, the modular inverse of n modulo k can only exist if GCD(n, k) = 1.

We have

130 = 2 • 5 • 13

231 = 3 • 7 • 11

so n must be free of 2, 3, 5, 7, 11, and 13, which are the first six primes. It follows that n = 17 must the least integer that satisfies the conditions.

To verify the claim, we try to solve the system of congruences

\begin{cases} 17x \equiv 1 \pmod{130} \\ 17y \equiv 1 \pmod{231} \end{cases}

Use the Euclidean algorithm to express 1 as a linear combination of 130 and 17:

130 = 7 • 17 + 11

17 = 1 • 11 + 6

11 = 1 • 6 + 5

6 = 1 • 5 + 1

⇒   1 = 23 • 17 - 3 • 130

Then

23 • 17 - 3 • 130 ≡ 23 • 17 ≡ 1 (mod 130)

so that x = 23.

Repeat for 231 and 17:

231 = 13 • 17 + 10

17 = 1 • 10 + 7

10 = 1 • 7 + 3

7 = 2 • 3 + 1

⇒   1 = 68 • 17 - 5 • 231

Then

68 • 17 - 5 • 231 ≡ = 68 • 17 ≡ 1 (mod 231)

so that y = 68.

3 0
2 years ago
Other questions:
  • Are my answer correct
    12·2 answers
  • Help mee please i want to pass
    8·2 answers
  • What is 18.5% of $3200 ?
    9·2 answers
  • You draw a simple random sample of 100 taxi drivers living in New York City. You wish to test whether mean time spent driving fo
    5·1 answer
  • 3. Critique Reasoning Each side of a square patio
    5·1 answer
  • Is this a proportional relationship
    9·2 answers
  • A nurse opens a case that has a total of 160 ounces of med. If each vial in the case holds 11/3 oz of me how many vials are in t
    5·1 answer
  • Please help for brainliest !!
    15·2 answers
  • Can someone help me some this
    8·2 answers
  • Nathan practices the piano 1260 minutes in 3 weeks. At what rate did she practice, in minutes per day?
    10·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!