Annual Payment where F is accumulated sum of amount, n is number of years and i is annual rate of interest. The standard notation equation is in the image since i can’t type it-
Answer:
15.24°C
Explanation:
The quality of any heat pump pumping heat from cold to hot place is determined by its coefficient of performance (COP) defined as

Where Q_{in} is heat delivered into the hot place, in this case, the house, and W is the work used to pump heat
You can think of this quantity as similar to heat engine's efficiency
In our case, the COP of our heater is

Where T_{house} = 24°C and T_{out} is temperature outside
To achieve maximum heating, we will have to use the most efficient heat pump, and, according to the second law of thermodynamics, nothing is more efficient that Carnot Heat Pump
Which has COP of:

So we equate the COP of our heater with COP of Carnot heater

Rearrange the equation

Solve this simple quadratic equation, and you should get that the lowest outdoor temperature that could still allow heat to be pumped into your house would be
15.24°C
Answer:
230.51 m
Explanation:
Pb = 695 mmHg
Pt = 675 mmHg
Pb - Pt = 20 mmHg
Calculate dP:
dP = p * g * H = (13600)*(9.81)*(20/1000) = 2668.320 Pa
Calculate Height of building as dP is same for any medium of liquid
dP = p*g*H = 2668.320
H = 2668.32 / (1.18 * 9.81) = 230.51 m
Answer:
I am Providing Answer in C Language Program.
Explanation:
Please find attachment regarding code of taking two numbers input and adding them.
I would like to recommend you please use software which supports C language.
#include <stdio.h>
int main () {
int a, b, sum;
printf ("\ nEnter two no:");
scanf ("% d% d", & d, & e);
sum1 = d + e;
printf ("Sum:% d", sum1);
return (0);
}
Answer:
Using the above algorithm matches one pair of Ghostbuster and Ghost. On each side of the line formed by the pairing, the number of Ghostbusters and Ghosts are the same, so use the algorithm recursively on each side of the line to find pairings. The worst case is when, after each iteration, one side of the line contains no Ghostbusters or Ghosts. Then, we need n/2 total iterations to find pairings, giving us an P(
)- time algorithm.