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
alekssr [168]
3 years ago
11

How to solve this problem

Mathematics
1 answer:
RSB [31]3 years ago
5 0
Holy @$#% THAT LOOKS HARD! Sorry, I can't help I don't know that math yet. 
You might be interested in
Please help me i’m being timed
Vera_Pavlovna [14]

Answer:

...............c

Step-by-step explanation:

6 0
3 years ago
Y = 6x − 4
Kamila [148]

Answer:

Part B: \displaystyle [1, 2]

Part A: Set both equation equal to each other by Substitution, since our <em>y-values</em> are already given to us.

Step-by-step explanation:

6x - 4 = 5x - 3

- 6x + 3 - 6x + 3

____________

\displaystyle -1 = -x; 1 = x

Plug this coordinate back into the above equations to get the <em>y-coordinate</em><em> </em>of 2.

<em>y</em><em> </em><em>=</em><em> </em><em>mx</em><em> </em><em>+</em><em> </em><em>b</em><em> </em>[where<em> </em><em>b</em><em> </em>is the y-intercept and the rate of change (slope) is represented by <em>m</em>]

\displaystyle y = 5x - 3; [0, -3]; 5 = m \\ y = 6x - 4; [0, -4]; 6 = m

I am joyous to assist you at any time.

3 0
3 years ago
Type the equivalent fraction using the multiplier 2.<br><br> 4/5
natulia [17]
8/10 is an equivalent fraction for 4/5.
7 0
3 years ago
Mark all true statements. Group of answer choices
laiz [17]

Answer:

True

False

Step-by-step explanation:

a) The first statement is the basis for Euclid's algorithm to compute the gcd of two nonnegative integers a,b. You can prove this as follows.

Let G=gcd(a,b). Since r=a-bq and G divides a and G divides b, then G divides r. Now, G divides a and G divides r, hence G divides gcd(b,r).

On the other hand, since a=bq+r, and gcd(b,r) divides b and r, then gcd(b,r) divides a. Therefore gcd(b,r) divides a and b, which implies that gcd(b,r) divides G.

x divides y and y divides x implies that |x|=|y|. The GCD's are nonnegative, therefore G=gcd(b,r).

b) It is false. In general, to test for primality of N, you have to check that all primes smaller than N do not divide N. In this case, we have to check for 2,3,5,7,11,13,17,19,23,...

101 is prime, but this may be false in general. For example, consider N=13*11=143. N is not prime, and n is not divisible by 2,3,5, or 7.

5 0
3 years ago
I need help plz.......................................
umka21 [38]
Which one do you need help with

4 0
3 years ago
Other questions:
  • Simplify (-4/5) ÷ (3/-2)<br><br> Please help!!!
    12·2 answers
  • A convenience store manager wants to find out
    13·2 answers
  • Which of the following is always true? Choose the correct answer below.
    11·1 answer
  • A new gym is being built at a local high school. The length of the gym on the blueprint is 12 inches. Find the actual length of
    11·1 answer
  • Help me on this math homework question please? Thank you! 10 points!!
    12·2 answers
  • What is a simplified form of the expression 2(–x + 2) + 3x?
    8·2 answers
  • What is 4 2/3 plus 3 1/4​
    8·2 answers
  • A soccer ball has a radius of 11 cm. Using 3.15
    15·2 answers
  • Please help! <br> Don't mind the one with the answer. Please just answer them all.
    10·1 answer
  • ......help please......<br> .<br> .
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!