Find integer if consecutive even integers is the number 126, Mathematics

Assignment Help:

The sum of two consecutive even integers is the number 126. What are the integers?

Two consecutive even integers are numbers in sequence, such as 4 and 6 or -30 and -32, that are each 2 numbers apart. Let x = the ?rst consecutive even integer. Let x + 2 = the second (and larger) consecutive even integer. Sum is a key word for addition so the equation becomes (x) + (x + 2) = 126. Combine like terms on the left side of the equation: 2x + 2 = 126. Subtract 2 from both sides of the equation: 2x + 2 - 2 = 126 - 2; simplify: 2x = 124. Divide each side of the equation by 2: 2x/2 = 124/2 . The variable is now alone: x = 62. Therefore the larger integer is: x+ 2 = 64.


Related Discussions:- Find integer if consecutive even integers is the number 126

Compute the regular expression, 1. Consider the following context free gram...

1. Consider the following context free grammar G with start symbol S (we write E for the empty string, epsilon): S ---> bB | aSS A ---> aB | bAA B ---> E | bA | aS a. D

Math, i really ned help wiv quartiles plz help

i really ned help wiv quartiles plz help

Arithmetic sequence, find a30 given that the first few terms of an arithmet...

find a30 given that the first few terms of an arithmetic sequence are given by 6,12,18...

12, Ask question #Minimum 100 words accepted linear algebra

Ask question #Minimum 100 words accepted linear algebra

Derivatives, Derivatives The rate of change in the value of a...

Derivatives The rate of change in the value of a function is useful to study the behavior of a function. This change in y for a unit change in x is

Forecasting by using least squares, Forecasting By Using Least Squares ...

Forecasting By Using Least Squares Data have been kept of sales over the last seven years Year 1 2 3 4 5 6

Calculus, I need help with my calculus work

I need help with my calculus work

Fibonacci number, 1. Suppose n ≡ 7 (mod 8). Show that n ≠ x 2 + y 2 + z 2...

1. Suppose n ≡ 7 (mod 8). Show that n ≠ x 2 + y 2 + z 2 for any x, y, z ε Z. 2. Prove ∀n ε Z, that n is divisible by 9 if and only if the sum of its digits is divisible by 9.

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