After modelling the mathematical statement and solving its equivalent mathematical relation, we get x = -36.
<h3>What is Equation Modelling?</h3>
Equation modelling is the process of writing a given mathematical statement in the form of a numeric mathematical expression taking into considerations the operations, constants and other variables.
Given in the question is a number such that twice the difference of a number and 9 is equal to three times the sum of the number and 6.
Assume that the number is x. Now, we will model the equation and solve for x. According to the question, the following mathematical relation represents the statement-
2(x - 9) = 3(x + 6)
2x - 18 = 3x + 18
x = - 36
Therefore, the number is -36.
To solve more questions on Equation modelling, visit the link below-
brainly.com/question/13536824
#SPJ1
Okay, I’m pretty sire this is right.
A: (-1, 3)
B: (-3, 2)
C: (-8, 3)
D: (-4, 3)
To do this problem (I am not completely confident in this) I am pretty sure you flip the signs for both the x and y values due to the rotation of the shape 180°, then add 6 to the y value.
Hello there!
Your final answer would be
(<span>
(6x + 5) • (6x - 5)).Your correct answer would be
(option d).I hope this helps you!</span>
Step-by-step explanation:
x=14-6y/3
substituting x=14-6y/3 into eqn 2
2(14-6y/3)+8y=2
multiplying through by 3
2(14-6y/3)×3 +8y×3=2×3
2(14-6y)+24y=6
28-12y+24y=6
28-12y=6
28-6=12y
22=12y
22/12=y
finding x
2x+8(22/12)=2
2x+44/3=2
2x=2-44/3
x=(-38/3)/2
×=-38/6
I will be using the language C++. Given the problem specification, there are an large variety of solving the problem, ranging from simple addition, to more complicated bit testing and selection. But since the problem isn't exactly high performance or practical, I'll use simple addition. For a recursive function, you need to create a condition that will prevent further recursion, I'll use the condition of multiplying by 0. Also, you need to define what your recursion is.
To wit, consider the following math expression
f(m,k) = 0 if m = 0, otherwise f(m-1,k) + k
If you calculate f(0,k), you'll get 0 which is exactly what 0 * k is.
If you calculate f(1,k), you'll get 0 + k, which is exactly what 1 * k is.
So here's the function
int product(int m, int k)
{
if (m == 0) return 0;
return product(m-1,k) + k;
}
