All categories

2 years ago

Please help me with this please and thank you

Mathematics

2 answers:

Damm [24]2 years ago

7 0

Answer:

A. 3, 6, 12, 24

Step-by-step explanation:

In A, you're multiplying by 2 each time.

Mekhanik [1.2K]2 years ago

4 0

Answer:

Step-by-step explanation:

it's a geometric sequence since it is continuously being multiplied by the same number which in this case is 2.

You might be interested in

AveGali [126]

Answer:

Total time taken by walking, running and cycling = 22 minutes.

Step-by-step explanation:

Let the speed of walking = x

As given,

The distance of walking = 1

Now,

As $Time = \frac{Distance }{Speed}$

⇒ Time traveled by walking = $\frac{1}{x}$

Now,

Given that - He runs twice as fast as he walks

⇒Speed of running = 2x

Also given distance traveled by running = 1

Time traveled by running = $\frac{1}{2x}$

Now,

Given that - he cycles one and a half times as fast as he runs.

⇒Speed of cycling = $\frac{3}{2}$ (2x) = 3x

Also given distance traveled by cycling = 1

Time traveled by cycling = $\frac{1}{3x}$

Now,

Total time traveled = Time traveled by walking + running + cycling

= $\frac{1}{x}$ + $\frac{1}{2x}$ + $\frac{1}{3x}$

= $\frac{6+3+2}{6x} = \frac{11}{6x}$

If he cycled the three mile , then total time taken = $\frac{1}{3x}$ + $\frac{1}{3x}$ + $\frac{1}{3x}$ = x

Given,

He takes ten minutes longer than he would do if he cycled the three miles

⇒x + 10 = $\frac{11}{6} x$

⇒ $x - \frac{11}{6} x = -10$

⇒ $-\frac{5}{6}x = -10$

⇒x = $\frac{60}{5}$ = 12

⇒x = 12

∴ we get

Total time traveled by walking + running + cycling = $\frac{11}{6} x = \frac{11}{6} (12) = 11 (2) = 22$ min

7 0

2 years ago

Without using a division or multiplication operator and without using iteration , define a recursive method named product that a

Fantom [35]

I will be using the language C++. Given the problem specification, there are an large variety of solving the problem, ranging from simple addition, to more complicated bit testing and selection. But since the problem isn't exactly high performance or practical, I'll use simple addition. For a recursive function, you need to create a condition that will prevent further recursion, I'll use the condition of multiplying by 0. Also, you need to define what your recursion is.
To wit, consider the following math expression
f(m,k) = 0 if m = 0, otherwise f(m-1,k) + k
If you calculate f(0,k), you'll get 0 which is exactly what 0 * k is.
If you calculate f(1,k), you'll get 0 + k, which is exactly what 1 * k is.
So here's the function
int product(int m, int k)
{
if (m == 0) return 0;
return product(m-1,k) + k;
}

8 0

3 years ago

A bagel shop sold 8 plain bagels and 13 rye bagels. What is the ratio of the number of rye bagels to the number of plain bagels

serious [3.7K]

Nipple man because I love balls

6 0

3 years ago

An urn contains balls numbered 1 through 20. A ball is chosen, returned to the urn, and a second ball is chosen. What is the pro

stira [4]

<h2>Answer:</h2>

The probability is:

$\dfrac{1}{400}$