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
bearhunter [10]
2 years ago
13

1. complete the table to show how to solve one-step equations pls help tyty

Mathematics
1 answer:
9966 [12]2 years ago
5 0

Answer:

8 is subtracted from x

The inverse operation is addition

Add 8 to both sides

X=-2 so I think that it is: 10 is added to x

The inverse operation is subtraction

Subtract 10 from both sides

4 is multiplied by x

The inverse operation is division

Divide 4 from both sides

X is divided by 2

The inverse operation is multiplication

Multiply each side by 2

Hope it helps!

You might be interested in
Point B corresponds to which Ordered Pair.. Question 1 options: (2, 6) (−2, 6) (2, −6) (−2, −6)
skad [1K]

where is the chart i cant say with out a chart

put the chart in another question and ill awwnser it because theres not enough information

5 0
3 years ago
I don’t understand how to solve
tankabanditka [31]
7.C I think is the answer
7 0
3 years ago
Prove that u(n) is a group under the operation of multiplication modulo n.
katrin2010 [14]

Answer:

The answer is the proof so it is long.

The question doesn't define u(n), but it's not hard to guess.


Group G with operation ∘

For all a and b and c in G:

1) identity: e ∈ G, e∘a = a∘e = a,

2) inverse: a' ∈ G, a∘a' = a'∘a = e,

3) closed: a∘b ∈ G,

4) associative: (a∘b)∘c = a∘(b∘c),

5) (optional) commutative: a∘b = b∘a.


Define group u(n) for n prime is the set of integers 0 < i < n with operation multiplication modulo n.


If n isn't prime, we exclude from the group all integers which share factors with n.


Identity: e = 1. Clearly 1∘a = a∘1 = a. (a is already < n).


Closed: u(n) is closed for n prime. We must show that for all a, b ∈ u(n), the integer product ab is not divisible by n, so that ab ≢ 0 (mod n). Since n is prime, ab ≠ n. Since a < n, b < n, no factors of ab can equal prime n. (If n isn't prime, we already excluded from u(n) all integers sharing factors with n).


Inverse: for all a ∈ u(n), there is a' ∈ u(n) with a∘a' = 1. To find a', we apply Euclid's algorithm and write 1 as a linear combination of n and a. The coefficient of a is a' < n.


Associative and Commutative:

(a∘b)∘c = a∘(b∘c) because (ab)c = a(bc)

a∘b = b∘a because ab = ba.


5 0
2 years ago
Read 2 more answers
Robin donated bags of grain that each weighed 40/3 pounds to the local food shelf. If the total weight of the grain was 160 poun
Novay_Z [31]

Answer:

d 12

Step-by-step explanation:

7 0
2 years ago
Show 3 rows of 2 counters
Julli [10]
C= a counter
c c
c c
c c
3 0
3 years ago
Other questions:
  • 289 and y more is 206
    6·1 answer
  • (2/3 * 2/3)(1/2 * 1/2) <br> (2/3 * 2/3)(1/2 * 1/2) in fraction form
    8·2 answers
  • 5m &gt; 20 how do I solve this??
    7·1 answer
  • 3) The coordinates of point A are (−3, 6) and the coordinates of point B are (3, −6). Find the slope of AB
    10·2 answers
  • Which measure of center makes the stock look the most profitable?
    15·1 answer
  • What is 6.34 when the 34 is repeating as a fraction
    10·1 answer
  • A drawer has a volume of 1,575 cubic inches. The drawer is 21 inches long
    8·1 answer
  • What is the present value of 6000 received 14 years from today when the interest rate is 10%
    14·1 answer
  • A bag contains 3 white balls, 4 green balls. 2 balls are drawn from the bag without replacement. Use a tree diagram to find the
    7·2 answers
  • I need help with this please help it’s due tonight
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!