All categories

3 years ago

How many bags of each cookie did Stephanie sell? How many total bags of cookies did she sell

Mathematics

1 answer:

____ [38]3 years ago

4 0

Numbers for the equation

You might be interested in

HELP ME PLZ BRAINLIST 4 U

mylen [45]

Answer:

Step-by-step explanation:

I think its G because i counted the numbers...and i pretty sure its not a Negative so yah

8 0

3 years ago

The university took a phone survey of 3421 students about tuition. Of the students surveyed 2004 of those students believed that

Nat2105 [25]

Is the answer c or d i say c

8 0

3 years ago

Read 2 more answers

How many terms are there in the sequence 1, 8, 28, 56, ..., 1 ?

BabaBlast [244]

Answer:

9 terms

Step-by-step explanation:

Given:

1, 8, 28, 56, ..., 1

Required

Determine the number of sequence

To determine the number of sequence, we need to understand how the sequence are generated

The sequence are generated using

$\left[\begin{array}{c}n&&r\end{array}\right] = \frac{n!}{(n-r)!r!}$

Where n = 8 and r = 0,1....8

When r = 0

$\left[\begin{array}{c}8&&0\end{array}\right] = \frac{8!}{(8-0)!0!} = \frac{8!}{8!0!} = 1$

When r = 1

$\left[\begin{array}{c}8&&1\end{array}\right] = \frac{8!}{(8-1)!1!} = \frac{8!}{7!1!} = \frac{8 * 7!}{7! * 1} = \frac{8}{1} = 8$

When r = 2

$\left[\begin{array}{c}8&&2\end{array}\right] = \frac{8!}{(8-2)!2!} = \frac{8!}{6!2!} = \frac{8 * 7 * 6!}{6! * 2 *1} = \frac{8 * 7}{2 *1} =2 8$

When r = 3

$\left[\begin{array}{c}8&&3\end{array}\right] = \frac{8!}{(8-3)!3!} = \frac{8!}{5!3!} = \frac{8 * 7 * 6 * 5!}{5! *3* 2 *1} = \frac{8 * 7 * 6}{3 *2 *1} = 56$

When r = 4

$\left[\begin{array}{c}8&&4\end{array}\right] = \frac{8!}{(8-4)!4!} = \frac{8!}{4!3!} = \frac{8 * 7 * 6 * 5 * 4!}{4! *4*3* 2 *1} = \frac{8 * 7 * 6*5}{4*3 *2 *1} = 70$

When r = 5

$\left[\begin{array}{c}8&&5\end{array}\right] = \frac{8!}{(8-5)!5!} = \frac{8!}{5!3!} = \frac{8 * 7 * 6 * 5!}{5! *3* 2 *1} = \frac{8 * 7 * 6}{3 *2 *1} = 56$

When r = 6

$\left[\begin{array}{c}8&&6\end{array}\right] = \frac{8!}{(8-6)!6!} = \frac{8!}{6!2!} = \frac{8 * 7 * 6!}{6! * 2 *1} = \frac{8 * 7}{2 *1} = 28$

When r = 7

$\left[\begin{array}{c}8&&7\end{array}\right] = \frac{8!}{(8-7)!7!} = \frac{8!}{7!1!} = \frac{8 * 7!}{7! * 1} = \frac{8}{1} = 8$

When r = 8

$\left[\begin{array}{c}8&&8\end{array}\right] = \frac{8!}{(8-8)!8!} = \frac{8!}{8!0!} = 1$

The full sequence is: 1,8,28,56,70,56,28,8,1

And the number of terms is 9

3 0

3 years ago

For integers a, b, and c, consider the linear Diophantine equation ax C by D c: Suppose integers x0 and y0 satisfy the equation;

Dmitrij [34]

Answer:

$x = x_1+r(\frac{b}{gcd(a, b)} )\\y=y_1-r(\frac{a}{gcd(a, b)} )$

b. x = -8 and y = 4

Step-by-step explanation:

This question is incomplete. I will type the complete question below before giving my solution.

For integers a, b, c, consider the linear Diophantine equation

$ax+by=c$

Suppose integers x0 and yo satisfy the equation; that is,

$ax_0+by_0 = c$

what other values

$x = x_0+h$ and $y=y_0+k$

also satisfy ax + by = c? Formulate a conjecture that answers this question.

Devise some numerical examples to ground your exploration. For example, 6(-3) + 15*2 = 12.

Can you find other integers x and y such that 6x + 15y = 12?

How many other pairs of integers x and y can you find ?

Can you find infinitely many other solutions?

From the Extended Euclidean Algorithm, given any integers a and b, integers s and t can be found such that

$as+bt=gcd(a,b)$

the numbers s and t are not unique, but you only need one pair. Once s and t are found, since we are assuming that gcd(a,b) divides c, there exists an integer k such that gcd(a,b)k = c.

Multiplying as + bt = gcd(a,b) through by k you get

$a(sk) + b(tk) = gcd(a,b)k = c$

So this gives one solution, with x = sk and y = tk.

Now assuming that ax1 + by1 = c is a solution, and ax + by = c is some other solution. Taking the difference between the two, we get

$a(x_1-x) + b(y_1-y)=0$

Therefore,

$a(x_1-x) = b(y-y_1)$

This means that a divides b(y−y1), and therefore a/gcd(a,b) divides y−y1. Hence,

$y = y_1+r(\frac{a}{gcd(a, b)})$ for some integer r. Substituting into the equation

$a(x_1-x)=rb(\frac{a}{gcd(a, b)} )\\gcd(a, b)*a(x_1-x)=rba$

$x = x_1-r(\frac{b}{gcd(a, b)} )$

Thus if ax1 + by1 = c is any solution, then all solutions are of the form

$x = x_1+r(\frac{b}{gcd(a, b)} )\\y=y_1-r(\frac{a}{gcd(a, b)} )$

In order to find all integer solutions to 6x + 15y = 12

we first use the Euclidean algorithm to find gcd(15,6); the parenthetical equation is how we will use this equality after we complete the computation.

$15 = 6*2+3\\6=3*2+0$