answersLogoWhite

0


Best Answer

2t+3

User Avatar

Wiki User

โˆ™ 2011-05-15 00:42:48
This answer is:
User Avatar
Study guides

Algebra

20 cards

A polynomial of degree zero is a constant term

The grouping method of factoring can still be used when only some of the terms share a common factor A True B False

The sum or difference of p and q is the of the x-term in the trinomial

A number a power of a variable or a product of the two is a monomial while a polynomial is the of monomials

โžก๏ธ
See all cards
3.8
โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…
1979 Reviews

Add your answer:

Earn +20 pts
Q: How do you write twice the sum of t and 3?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Twice the sum of s and t decreased by s?

2 + s(t) -s


What is the answer to 3 times the sum of t and 7?

3*(t + 7) or 3t + 21


How would you write the quotient of twice a number t and 12?

2t/12


How do you factor the expression t plus 3 cubed?

(t+3)3 is already factored. Could write it as (t+3)(t+3)(t+3).


Program for count the total number of node in binary tree?

int count (const Tree *t) { int sum; if (!t) return 0; else sum=1; if (t->left) sum += count (t->left); if (t->right) sum += count (t->right); return sum; } advanced: int count (const Tree *t) { int sum= 0; while (t) { sum++; if (t->left) { if (t->right) sum += count (t->right); t = t->left; } else t = t->right; } return sum; }


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; }


What is O T 3 T a L?

Once, Twice, Three Times a Lady (song - the Commodores)


How do you write a c plus plus program to calculate the sum of squares using a function?

Use a template function to calculate the square of any value, then sum the squares. The following example demonstrates how to sum the squares of integers 3 and 5. #include<iostream> template <class T> T sq(T& value) { return( value*value ); } int main() { #using namespace std; int x=3, y=5; cout<<"The sum of "<<x<<" squared plus "<<y<<" squared is " <<sq(x)+sq(y)<<endl; return(0); }


What is t sum of 2 to the power of 4 and 7 to the power of 2 Write the answer in standard form?

16 + 49 = 65


The sum of 8 and t?

8+t


Write a program in c language to check whether a given integer is a strong number or not using nested loops?

#include<stdio.h> void main() { int n,t,sum=0; float fact=1; clrscr(); printf("enter the number"); scanf(%d",&n); t=n; while(t) { for(i=0;i<=t%10;i++) { fact=fact*i; } sum=sum+fact; fact=1; t=t/10; } if(n==sum) { printf("strong number"); } else { printf("not strong number"); } getch(); }


The first and fourth terms of a geometric progression are 54 and 2 respectively Find the sum to infinity of the geometric progression?

t(1) = a = 54 t(4) = a*r^3 = 2 t(4)/t(1) = r^3 = 2/54 = 1/27 and so r = 1/3 Then sum to infinity = a/(1 - r) = 54/(1 - 1/3) = 54/(2/3) = 81.

People also asked