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
ddd [48]
2 years ago
13

What two number multiple to get -72 and add up to -6

Mathematics
1 answer:
hammer [34]2 years ago
7 0

Answer:

6 and -12

Step-by-step explanation:

6×-12=-72

6+(-12)=-6

×^2 -6x-72=0

(x+6) (x-12)

x^2-6x-72=(x+6) (X-12)

You might be interested in
Choose 3 values that would make this inequality true. 8n + 4 ≤ 28 <br><br> Choices:3,6,13,2,5,14,1
Lelu [443]

Answer:

1,2,3

Step-by-step explanation:

1*8=8+4+12<28

2*8=16+4=20<28

3*8=24+4=28=28

6 0
2 years ago
How many zeros are at the end of the number 2^12 x 5^7 ?
Katena32 [7]

Answer:

7 zeroes

Step-by-step explanation:

I HOPE it will help you

4 0
3 years ago
Read 2 more answers
Find the radius or diameter of each circle with the given dimensions.<br><br> d=30 m
Alex_Xolod [135]

Answer:

r=94.2

Step-by-step explanation:

C=pi`d

C=3.14 multiplied by 30

C equals about 94.2

6 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
3 years ago
Read 2 more answers
For g(x)=3x+1, determine g(3-2x)
wolverine [178]

Answer:

g(3−2x)=12x2−36x+29

Step-by-step explanation:

Do you need step by step?

5 0
3 years ago
Other questions:
  • Helpndmdkdkdndnfndndkdkdmd
    11·1 answer
  • PLEASE HELP!!!<br> Fill in the blanks problem<br> (please view both attachments)
    14·2 answers
  • Triangle Congruence:
    11·2 answers
  • 1) Fill the two pools below with water.
    7·2 answers
  • A bag of candy contains 300 pieces of which 28% are red. How many are not red?
    6·2 answers
  • . The model below represents the equation 3x + 2 = 11.
    9·1 answer
  • Help please please help help me!!!!
    11·1 answer
  • Enter the correct letter to match each summation expression with the property or formula. N Σ i=1 cai is equal to . A n(n + 1)(2
    7·1 answer
  • Which angles are supplementary to each other ?
    14·2 answers
  • What is x=5/2 plz answer
    14·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!