0
Add your answer:
Earn +20 pts
The sum of 8 and t?
8t
Twice the sum of s and t decreased by s?
2 + s(t) -s
What fraction of the letters in the word multiply are also in the word product?
3/8 (specifically u, t and p out of the eight different letters in "multiply").
2t plus 8 - t equals -3?
2t+8-t=-3(t+t)+8-t=-3-8 -8(t+t)-t=-11the -t and the +t cancel outt=-112(-11)+8-(-11)=-3-22+8+11=-3
The sum of 13 and T is at least 24?
13 + T >= 24 T >= 11 T is at least 11.
The sum of 8 and t?
8t
Twice the sum of s and t decreased by s?
2 + s(t) -s
If 8 is added to the variable t the sum is equal to the variable b?
t +8 = b
What is S fewer than the difference of 8 and t?
8-t-s
How do you write the value of s is 8 more than the value of t?
s = t + 8.
T two integers that have a difference of -18 and the sum of 2?
-8 and 10.---------------------------8 + 10 = 2-8 - 10 = -18
The points R S and T all lie on a numbered line R is -4 and S the midpoint is 2 What is T?
T = 8. The distance from R to S is 6. Since S is the midpoint, the distance from S to T is also 6. This means T has to equal 8.
8 p i t s s?
Could it be 8 Planets in the Solar System?
Recursive function in c to compute the number of nodes in a binary tree?
int Nodes (Tree *t) { int sum= 0; if (t) { sum+=1; if (t->left) sum += Nodes (t->left); if (t->right) sum += Nodes (t->right); } return sum; }
Can a insured surrender a life insurance policy after the policy holder dies?
T sum assured divided by multiply no for ex... 100000 / 30=3333
What is the Programme to calculate the sum of a five digit number?
#include #include void main(){long n,s=0,t,d;clrscr();cout > n;t=n;while(n>0){d=n%10;s=s+d;n=n/10;}cout
C program to find the sum of odd positioned digits and even positioned digits of a number seperately?
#include<stdio.h> #include<conio.h> main() { int n,s,r,t; clrscr(); printf("enter n"); scanf("%d",&n); s=0;t=0; while(n!=0) { r=n%10; { if(r%2!=0) t=t+r; if(r%2==0) s=s+r; } n=n/10; } printf("sum of even position digits%d\n",s); printf("sum of odd position digits%d\n",t); getch(); }
