Unfortunately, limitations of the browser used by Answers.com means that we cannot see most symbols. It is therefore impossible to give a proper answer to your question. Please resubmit your question spelling out the symbols as "plus", "minus", "equals" etc. And use ^ to indicate powers (eg x-squared = x^2).
51
There are infinitely many possible functions that can generate this sequence. One such isUn = (n2 - 3n + 2)/2 = (n-2)*(n-1)/2There are infinitely many possible functions that can generate this sequence. One such isUn = (n2 - 3n + 2)/2 = (n-2)*(n-1)/2There are infinitely many possible functions that can generate this sequence. One such isUn = (n2 - 3n + 2)/2 = (n-2)*(n-1)/2There are infinitely many possible functions that can generate this sequence. One such isUn = (n2 - 3n + 2)/2 = (n-2)*(n-1)/2
Fibonacci numbers are the numbers in a sequence defined as follows: N1 = 1 N2 = 1 and after that, each number is the sum of the last two numbers in the sequence. N3 = N1 + N2 N4 = N2 + N3 and so on.
It appears to be increasing in difference by 2. The nth number is n2 +2. 1*1+2=3 2*2+2=6 3*3+2=11
The sequence is too short for a definitive answer. One possibility is Un = n2 - 2n + 2 for n = 1, 2, 3, ... another is Un = (n3 - n + 6)/6 or Un = (n3 - 3n2 + 5)/3 There are many more.
51
There are infinitely many possible functions that can generate this sequence. One such isUn = (n2 - 3n + 2)/2 = (n-2)*(n-1)/2There are infinitely many possible functions that can generate this sequence. One such isUn = (n2 - 3n + 2)/2 = (n-2)*(n-1)/2There are infinitely many possible functions that can generate this sequence. One such isUn = (n2 - 3n + 2)/2 = (n-2)*(n-1)/2There are infinitely many possible functions that can generate this sequence. One such isUn = (n2 - 3n + 2)/2 = (n-2)*(n-1)/2
Fibonacci numbers are the numbers in a sequence defined as follows: N1 = 1 N2 = 1 and after that, each number is the sum of the last two numbers in the sequence. N3 = N1 + N2 N4 = N2 + N3 and so on.
The solution to the recurrence relation t(n) t(n-2) n2 is t(n) n2 (n-2)2 (n-4)2 ... 42 02. This relation shows that each term in the sequence is the square of the corresponding even number, starting from n. The overall pattern of the sequence is that it consists of the squares of even numbers in descending order, with each term being the square of the previous even number.
No, the coefficient sequence is not needed to balance the chemical equation for the reaction between magnesium (Mg) and nitrogen (N2) to form magnesium nitride (Mg3N2). The balanced chemical equation is already given as: 3Mg + N2 → Mg3N2.
Un = n3 + n2 - 3n - 2 for n = 1, 2, 3, ...
n2
It is T(n) = n2 - 2n + 6
n2-3n+2
(1/2n-r)2+((n2+2n)/4) where n is the row number and r is the position of the term in the sequence
(N2) + 3(H2) = 2(NH3)
It appears to be increasing in difference by 2. The nth number is n2 +2. 1*1+2=3 2*2+2=6 3*3+2=11