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
expeople1 [14]
3 years ago
15

4y-2x+3x-7y How do I solve this?

Mathematics
2 answers:
dybincka [34]3 years ago
8 0

4y - 2x + 3x - 7y

Just group the terms

3x - 2x + 4y - 7y

x - 3y

denis23 [38]3 years ago
7 0

Answer:

x - 3y

Step-by-step explanation:

4y - 2x + 3x -7y

ANSWER= x - 3y

TRUST ME ITS CORRECT ! 100% !

brainliest please thanks !

You might be interested in
Miguel, Jane, and Robert rode 8.7miles in a bike race. They each rode the same distance. Jane shadded the models shown to determ
dmitriy555 [2]
Each person rode 2.9 miles and A total of 8 ones and 7 tenths are shaded to model the total length of the race. The shading is equally divided into 3 groups to model the 3 riders. And each group has 2 ones and 9 tenths shaded to model the distance each person rode
3 0
3 years ago
The formula for the volume of a cylinder is . What is the approximate volume of two refraction cups? Use 3.14 for pi.
Veronika [31]

Answer:

Is there more information? I need like the height and stuff

5 0
3 years ago
Read 2 more answers
A city’s population, P, is modeled by the function P(x) = 78,500( 1.02 )x where x represents the number of years after the year
Levart [38]
Population 78500
Increased by 2%
3 0
3 years ago
5. The recursive algorithm given below can be used to compute gcd(a, b) where a and b are non-negative integer, not both zero.
s2008m [1.1K]

Implementating the given algorithm in python 3, the greatest common divisors of <em>(</em><em>124</em><em> </em><em>and</em><em> </em><em>244</em><em>)</em><em> </em>and <em>(</em><em>4424</em><em> </em><em>and</em><em> </em><em>2111</em><em>)</em><em> </em>are 4 and 1 respectively.

The program implementation is given below and the output of the sample run is attached.

def gcd(a, b):

<em>#initialize</em><em> </em><em>a</em><em> </em><em>function</em><em> </em><em>named</em><em> </em><em>gcd</em><em> </em><em>which</em><em> </em><em>takes</em><em> </em><em>in</em><em> </em><em>two</em><em> </em><em>parameters</em><em> </em>

if a>b:

<em>#checks</em><em> </em><em>if</em><em> </em><em>a</em><em> </em><em>is</em><em> </em><em>greater</em><em> </em><em>than</em><em> </em><em>b</em>

return gcd (b, a)

<em>#if</em><em> </em><em>true</em><em> </em><em>interchange</em><em> </em><em>the</em><em> </em><em>Parameters</em><em> </em><em>and</em><em> </em><em>Recall</em><em> </em><em>the</em><em> </em><em>function</em><em> </em>

elif a == 0:

return b

elif a == 1:

return 1

elif((a%2 == 0)and(b%2==0)):

<em>#even</em><em> </em><em>numbers</em><em> </em><em>leave</em><em> </em><em>no</em><em> </em><em>remainder</em><em> </em><em>when</em><em> </em><em>divided</em><em> </em><em>by</em><em> </em><em>2</em><em>,</em><em> </em><em>checks</em><em> </em><em>if</em><em> </em><em>a</em><em> </em><em>and</em><em> </em><em>b</em><em> </em><em>are</em><em> </em><em>even</em><em> </em>

return 2 * gcd(a/2, b/2)

elif((a%2 !=0) and (b%2==0)):

<em>#checks</em><em> </em><em>if</em><em> </em><em>a</em><em> </em><em>is</em><em> </em><em>odd</em><em> </em><em>and</em><em> </em><em>B</em><em> </em><em>is</em><em> </em><em>even</em><em> </em>

return gcd(a, b/2)

else :

return gcd(a, b-a)

<em>#since</em><em> </em><em>it's</em><em> </em><em>a</em><em> </em><em>recursive</em><em> </em><em>function</em><em>,</em><em> </em><em>it</em><em> </em><em>recalls</em><em> </em><em>the function</em><em> </em><em>with </em><em>new</em><em> </em><em>parameters</em><em> </em><em>until</em><em> </em><em>a</em><em> </em><em>certain</em><em> </em><em>condition</em><em> </em><em>is</em><em> </em><em>satisfied</em><em> </em>

print(gcd(124, 244))

print()

<em>#leaves</em><em> </em><em>a</em><em> </em><em>space</em><em> </em><em>after</em><em> </em><em>the</em><em> </em><em>first</em><em> </em><em>output</em><em> </em>

print(gcd(4424, 2111))

Learn more :brainly.com/question/25506437

6 0
2 years ago
Find the number of combinations for choosing two people from six.
Talja [164]
Number of combinations = (6x5) ÷ 2 = 15

Answer:There are 15 combinations
7 0
3 years ago
Other questions:
  • Write the equation of a line in slope-intercept form that goes through the points (-4, 3) and (-5, 1). Show your work.
    10·1 answer
  • Which rigid transformation would map MZK to QZK?
    8·2 answers
  • Hayley runs a day care center. So far this year, the enrollment has consisted of 3
    6·1 answer
  • Round 2.972 to the nearest hundredth
    11·1 answer
  • (WILL GIVE BRAINLIST) The number of phone calls received by the complaint department of a small company over a five day period i
    10·1 answer
  • What is the median of this data set? <br><br> Help!!!!!
    8·1 answer
  • Solve for all values of x:
    13·1 answer
  • Ana can bike 9 kilometers in 24 minutes. At this rate, how far can Ana bike in 1 minute? __ kilometer(s) per minute
    7·1 answer
  • In​ basketball, some baskets are worth two points. Others are worth three points. In one​ game, the ratio of​ three-point basket
    12·1 answer
  • Brandon wants to ride his bicycle 21 miles this week. He has already ridden 6 miles. If he rides for 5 more days, write and solv
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!