All categories

2 years ago

I need help for this question

Mathematics

2 answers:

geniusboy [140]2 years ago

4 0

Answer:

cat,8,6

Step-by-step explanation:

i think im not sure

Alik [6]2 years ago

3 0

9514 1404 393

Answer:

a) Cat

b) 8

c) 6

Step-by-step explanation:

a) Each line contains one large square, at least. The smallest additional area is on the Cat line. Apparently, the fewest people preferred cats.

b) The smaller symbols appear to represent 1/4, 1/2, and 3/4 of the larger square. On that basis, we can add all of the symbols to discover there are a total of 10 of them:

1 1/4 +1 3/4 +2 1/2 +1 1/2 + 3 = 8 + (1/4 +3/4) +(1/2 +1/2) = 8 +1 +1 = 10

Since 10 symbols represent 80 people, each large square symbol must represent 8 people.

c) The number preferring dogs is (1 3/4)(8) = 14. The number preferring giraffes is (2 1/2)(8) = 20. Then 20 -14 = 6 more people preferred giraffes.

You might be interested in

Can anyone help me with this. Click to see

IgorLugansk [536]

Answer: mean = 6

median = 7

mode = 8

Step-by-step explanation:

8 0

2 years ago

Solve these recurrence relations together with the initial conditions given. a) an= an−1+6an−2 for n ≥ 2, a0= 3, a1= 6 b) an= 7a

8_murik_8 [283]

Answer:

a) 3/5·((-2)^n + 4·3^n)
b) 3·2^n - 5^n
c) 3·2^n + 4^n
d) 4 - 3 n
e) 2 + 3·(-1)^n
f) (-3)^n·(3 - 2n)
g) ((-2 - √19)^n·(-6 + √19) + (-2 + √19)^n·(6 + √19))/√19

Step-by-step explanation:

These homogeneous recurrence relations of degree 2 have one of two solutions. Problems a, b, c, e, g have one solution; problems d and f have a slightly different solution. The solution method is similar, up to a point.

If there is a solution of the form $a[n]=r^n$ , then it will satisfy ...

$r^n=c_1\cdot r^{n-1}+c_2\cdot r^{n-2}$

Rearranging and dividing by $r^{n-2}$ , we get the quadratic ...

$r^2-c_1r-c_2=0$

The quadratic formula tells us values of r that satisfy this are ...

$r=\dfrac{c_1\pm\sqrt{c_1^2+4c_2}}{2}$

We can call these values of r by the names r₁ and r₂.

Then, for some coefficients p and q, the solution to the recurrence relation is ...

$a[n]=pr_1^n+qr_2^n$

We can find p and q by solving the initial condition equations:

$\left[\begin{array}{cc}1&1\\r_1&r_2\end{array}\right] \left[\begin{array}{c}p\\q\end{array}\right] =\left[\begin{array}{c}a[0]\\a[1]\end{array}\right]$

These have the solution ...

$p=\dfrac{a[0]r_2-a[1]}{r_2-r_1}\\\\q=\dfrac{a[1]-a[0]r_1}{r_2-r_1}$

_____

Using these formulas on the first recurrence relation, we get ...

$c_1=1,\ c_2=6,\ a[0]=3,\ a[1]=6\\\\r_1=\dfrac{1+\sqrt{1^2+4\cdot 6}}{2}=3,\ r_2=\dfrac{1-\sqrt{1^2+4\cdot 6}}{2}=-2\\\\p=\dfrac{3(-2)-6}{-5}=\dfrac{12}{5},\ q=\dfrac{6-3(3)}{-5}=\dfrac{3}{5}\\\\a[n]=\dfrac{3}{5}(-2)^n+\dfrac{12}{5}3^n$

The rest of (b), (c), (e), (g) are solved in exactly the same way. A spreadsheet or graphing calculator can ease the process of finding the roots and coefficients for the given recurrence constants. (It's a matter of plugging in the numbers and doing the arithmetic.)

_____

For problems (d) and (f), the quadratic has one root with multiplicity 2. So, the formulas for p and q don't work and we must do something different. The generic solution in this case is ...

$a[n]=(p+qn)r^n$