All categories

3 years ago

There are 623 steps in Castle A There are 245 more steps in Castle B than in Castle A. How many steps are there in Castle B

Mathematics

2 answers:

olasank [31]3 years ago

7 0

There would be 868 steps. since there is 245 MORE steps in castle be than in castle a, you would have to add 623 to 245

Bas_tet [7]3 years ago

6 0

868
623 + 200 = 823
823 + 40 = 863
863 + 5 = 868

You might be interested in

Please help Me I really need the help

Nana76 [90]

Answer:

Step-by-step explanation:

sinice they are similar they have the same angles so 180-118-15=f

so f=47

3 0

3 years ago

Is there a commutative property of subtraction that states a-b=b-a? investigate and make a conclusion that you justify.

Rom4ik [11]

No is your answer

Assuming that b ≠ a, the answers will not be the same.

For example, (remembering that b ≠ a) let us assume that b = 10, a = 5

10 - 5 = 5

5 - 10 = -5

5 ≠ -5

So the commutative property of subtraction does not work unless in certain cases, in which a = b.

hope this helps

5 0

3 years ago

I need some help, yes this is a repost soz.

Alinara [238K]

Answer:

Whats the question ;-;

Step-by-step explanation:

6 0

2 years ago

Binomial Expansion/Pascal's triangle. Please help with all of number 5.

Mandarinka [93]

$\begin{matrix}1\\1&1\\1&2&1\\1&3&3&1\\1&4&6&4&1\end{bmatrix}$

The rows add up to $1,2,4,8,16$ , respectively. (Notice they're all powers of 2)

The sum of the numbers in row $n$ is $2^{n-1}$ .

The last problem can be solved with the binomial theorem, but I'll assume you don't take that for granted. You can prove this claim by induction. When $n=1$ ,

$(1+x)^1=1+x=\dbinom10+\dbinom11x$

so the base case holds. Assume the claim holds for $n=k$ , so that

$(1+x)^k=\dbinom k0+\dbinom k1x+\cdots+\dbinom k{k-1}x^{k-1}+\dbinom kkx^k$

Use this to show that it holds for $n=k+1$ .

$(1+x)^{k+1}=(1+x)(1+x)^k$
$(1+x)^{k+1}=(1+x)\left(\dbinom k0+\dbinom k1x+\cdots+\dbinom k{k-1}x^{k-1}+\dbinom kkx^k\right)$
$(1+x)^{k+1}=1+\left(\dbinom k0+\dbinom k1\right)x+\left(\dbinom k1+\dbinom k2\right)x^2+\cdots+\left(\dbinom k{k-2}+\dbinom k{k-1}\right)x^{k-1}+\left(\dbinom k{k-1}+\dbinom kk\right)x^k+x^{k+1}$

Notice that

$\dbinom k\ell+\dbinom k{\ell+1}=\dfrac{k!}{\ell!(k-\ell)!}+\dfrac{k!}{(\ell+1)!(k-\ell-1)!}$
$\dbinom k\ell+\dbinom k{\ell+1}=\dfrac{k!(\ell+1)}{(\ell+1)!(k-\ell)!}+\dfrac{k!(k-\ell)}{(\ell+1)!(k-\ell)!}$
$\dbinom k\ell+\dbinom k{\ell+1}=\dfrac{k!(\ell+1)+k!(k-\ell)}{(\ell+1)!(k-\ell)!}$
$\dbinom k\ell+\dbinom k{\ell+1}=\dfrac{k!(k+1)}{(\ell+1)!(k-\ell)!}$
$\dbinom k\ell+\dbinom k{\ell+1}=\dfrac{(k+1)!}{(\ell+1)!((k+1)-(\ell+1))!}$
$\dbinom k\ell+\dbinom k{\ell+1}=\dbinom{k+1}{\ell+1}$

So you can write the expansion for $n=k+1$ as

$(1+x)^{k+1}=1+\dbinom{k+1}1x+\dbinom{k+1}2x^2+\cdots+\dbinom{k+1}{k-1}x^{k-1}+\dbinom{k+1}kx^k+x^{k+1}$

and since $\dbinom{k+1}0=\dbinom{k+1}{k+1}=1$ , you have

$(1+x)^{k+1}=\dbinom{k+1}0+\dbinom{k+1}1x+\cdots+\dbinom{k+1}kx^k+\dbinom{k+1}{k+1}x^{k+1}$

and so the claim holds for $n=k+1$ , thus proving the claim overall that

$(1+x)^n=\dbinom n0+\dbinom n1x+\cdots+\dbinom n{n-1}x^{n-1}+\dbinom nnx^n$

Setting $x=1$ gives

$(1+1)^n=\dbinom n0+\dbinom n1+\cdots+\dbinom n{n-1}+\dbinom nn=2^n$

which agrees with the result obtained for part (c).

4 0

3 years ago

Four consecutive integer numbers that add up to 2. What are the numbers?? -HELP PLS

Alja [10]

Answer:

-1, 0, 1, 2

Step-by-step explanation:

-1 + 0 + 1 + 2 = 2

6 0

2 years ago

Read 2 more answers