The sum of two consecutive integers is 41 integer, Mathematics

Assignment Help:

The sum of two consecutive integers is 41. What are the integers?

Two consecutive integers are numbers in sequence like 4 and 5 or -30 and -29, that are each 1 number apart. Let x = the ?rst consecutive integer. Let x + 1 = the second consecutive integer. Sum is a key word for addition so the equation becomes: (x )+ (x + 1) = 41. Combine like terms on the left side of the equation: 2x + 1 = 41. Subtract 1 from both sides of the equation: 2x + 1 - 1 = 41 - 1. Simplify: 2x = 40. Divide each side of the equation by 2: 2x/2 = 40/2. The variable is now alone: x = 20. Therefore the larger integer is: x + 1 = 21. The two integers are 20 and 21.


Related Discussions:- The sum of two consecutive integers is 41 integer

Rate of change interpretation of derivative, Rate of Change : The first in...

Rate of Change : The first interpretation of derivative is rate of change.  It was not the primary problem which we looked at in the limit chapter, however it is the most signific

Discret math, i have a question about discret math

i have a question about discret math

5th grade, 6 and 3/8 minus 1 and 3/4

6 and 3/8 minus 1 and 3/4

Statistic, Suppose that the probability of your favorite baseball player ge...

Suppose that the probability of your favorite baseball player getting a hit at bat is 0.45. Assume that each at bat is independent. What is the probability that he bats eight times

What was brian''s total commission on these three sales, Brian is a real es...

Brian is a real estate agent. He forms a 2.5% commission on each sale. During the month of June he sold three houses. The houses sold for $153,000, $299,000, and $121,000. What was

Using euclid''s algorithm find the value of x & y, If d is the HCF of 30, 7...

If d is the HCF of 30, 72, find the value of x & y satisfying d = 30x + 72y. (Ans:5, -2 (Not unique) Ans:    Using Euclid's algorithm, the HCF (30, 72) 72 = 30 × 2 + 12

Parseval theorem, Verify the Parseval theorem for the discrete-time signal ...

Verify the Parseval theorem for the discrete-time signal x(n) and its DFT from given equations. Compute the linear convolution of the discrete-time signal x(n) ={3, 2, 2,1} and

Some important issue of graph, Some important issue of graph Before mov...

Some important issue of graph Before moving on to the next example, there are some important things to note. Firstly, in almost all problems a graph is pretty much needed.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd