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
elena-14-01-66 [18.8K]
3 years ago
14

Related subtraction fact for 7+6=13

Mathematics
2 answers:
andreev551 [17]3 years ago
5 0
7-6=13 or 6+7=13 hope that helps find the answer :D
Svet_ta [14]3 years ago
4 0
13-6=7 or 13-7=6 Hope this helps you
You might be interested in
How to solve this problem <br><br>.         0.3 [1.57 – (0.6)²]
love history [14]
Well (1.57- 0.6 X 0.6) x 0.3 = 0.363
3 0
3 years ago
Read 2 more answers
A ball is released at a height of 16 inches to roll inside a half-cylinder. It rolls
docker41 [41]

Answer:

Step-by-step explanation:

Using the given formula, we put n = 5

h = 8* {(\frac{1}{2}) ^{n-1}

h = 8 / 16

h = 1 / 2 inches

8 0
3 years ago
Which expressions go in which box?
almond37 [142]
To qualify as a polynomial, the expression in question:
* Consists of one or more terms 
* Variables are only with positive whole exponents
* No variables in the denominator of any term (the coefficients however, can be fractions.)

In that case the answer is most likely:

3 0
2 years ago
How to substitute x=-2 and x=5 into 2x^2+6-20=0 to check my work
Komok [63]
First answer (x=-2)
...
(2)[(-2)^2]+6-20
2(4)+6-20
8+6-20
14-20
<em>-6 (answer)
</em><em>
</em><em />Second answer (x=5)
...
(2)[(-5)^2]+6-20
2(25)+6-20
50+6-20
56-20
<em>36 (answer)
</em>Hope this helps!
4 0
3 years ago
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:
  • What is the gcf of 378,132
    14·1 answer
  • Maris has 1,400 minutes to use on her cell phone she has used 45% of her minutes how many minutes has she used
    15·2 answers
  • A 12% discount on a tent saved melanie $75 what was the original price
    14·1 answer
  • A circular fountain 10 feet in diameter has a circular walk 3 feet wide paved around it. What is the area of the walk?
    7·1 answer
  • 50 POINTS PLUS BRAINLIEST!
    14·1 answer
  • 3/4 = j−12.<br><br> Algebra
    15·2 answers
  • MY<br> LAST <br> QUESTION (NEED HELP ASAP) PLEASE!!!!
    5·1 answer
  • Paul bought 18 pins for $90. Jack bought 45 pins for $180. Who bought pins at the lowest cost?
    11·2 answers
  • Chinisa is swinging on a swing. Her maximum height above the ground is 7 feet and her minimum height above the ground is 1 foot.
    5·1 answer
  • Question 2
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!