Ask question

Ask question

All categories

soldi70 [24.7K]

2 years ago

10

An electronics store sells a laptop for p. During the sales period, the shopkeeper offers a 30% discount on the initial price. A

few days after the end of the sales, the shopkeeper starts the «Out of All» campaign to free the warehouse from inventories and applies an additional 20% discount. to. Express the final price of the computer as a fraction of p and verify that it is greater than 50% of the initial price. b. Knowing that the final price is € 448, it determines the initial price p and the amount of the first discount applied.

1 answer:

drek231 [11]2 years ago

7 0

Answer:

See below

Step-by-step explanation:

a)

Initial price is p.

<u>30% discounted price:</u>

p - 30% =
p*(1 - 0.3) =
0.7p

<u>Price after 20% discount:</u>

0.7p - 20% =
0.7p*(1 - 0.2) =
0.7p*0.8 =
0.56p

This is greater than the 50% which is 0.5p

b)

<u>If the final price is € 448, the initial price is:</u>

0.56p = €448
p = €448/0.56
p = €800

<u>The amount of first discount is 30% of € 800:</u>

0.3*€800 =
€240

You might be interested in

Plsss Help!! Will mark brainiest!! Due soon!!

Tom [10]

Answer:

(10, 8) is the distance.

Step-by-step explanation:

The x's are 10 points away from each other and y's are 8 points away from each other.

By the way, there is no second picture.

Sorry if I'm wrong. I might be more helpful if you upload the second picture.

7 0

3 years ago

Read 2 more answers

Kurt wants to informally prove the converse of the Pythagorean Theorem by producing some evidence that supports it.

Elis [28]

Answer:

A and C

Step-by-step explanation:

I had it on a test

4 0

3 years ago

We have x = 7 so now solve for y by replacing x with 7 in this equation 2x + y = 20

Ivahew [28]

Answer:

y=6

Step-by-step explanation:

2(7)=14.

subtract both sides by 14.

y=6

7 0

3 years ago

Read 2 more answers

Someone please help me

Cerrena [4.2K]

Answer:

-27 + 19 = -8

-78 - 36 = - 114

6 + 12 = 18

46 - 9 = 37

8 0

3 years ago

Prove that if n is a perfect square then n + 2 is not a perfect square

notka56 [123]

Answer:

This statement can be proven by contradiction for $n \in \mathbb{N}$ (including the case where $n = 0$ .)

$\text{Let $n \in \mathbb{N}$ be a perfect square}$ .

$\textbf{Case 1.} ~ \text{n = 0}$ :

$\text{$n + 2 = 2$, which isn't a perfect square}$ .

$\text{Claim verified for $n = 0$}$ .

$\textbf{Case 2.} ~ \text{$n \in \mathbb{N}$ and $n \ne 0$. Hence $n \ge 1$}$ .

$\text{Assume that $n$ is a perfect square}$ .

$\text{$\iff$ $\exists$ $a \in \mathbb{N}$ s.t. $a^2 = n$}$ .

$\text{Assume $\textit{by contradiction}$ that $(n + 2)$ is a perfect square}$ .

$\text{$\iff$ $\exists$ $b \in \mathbb{N}$ s.t. $b^2 = n + 2$}$ .

$\text{$n + 2 > n > 0$ $\implies$ $b = \sqrt{n + 2} > \sqrt{n} = a$}$ .

$\text{$a,\, b \in \mathbb{N} \subset \mathbb{Z}$ $\implies b - a = b + (- a) \in \mathbb{Z}$}$ .

$\text{$b > a \implies b - a > 0$. Therefore, $b - a \ge 1$}$ .

$\text{$\implies b \ge a + 1$}$ .

$\text{$\implies n+ 2 = b^2 \ge (a + 1)^2= a^2 + 2\, a + 1 = n + 2\, a + 1$}$ .

$\text{$\iff 1 \ge 2\,a $}$ .

$\text{$\displaystyle \iff a \le \frac{1}{2}$}$ .

$\text{Contradiction (with the assumption that $a \ge 1$)}$ .

$\text{Hence the original claim is verified for $n \in \mathbb{N}\backslash\{0\}$}$ .

$\text{Hence the claim is true for all $n \in \mathbb{N}$}$ .

Step-by-step explanation:

Assume that the natural number $n \in \mathbb{N}$ is a perfect square. Then, (by the definition of perfect squares) there should exist a natural number $a$ ( $a \in \mathbb{N}$ ) such that $a^2 = n$ .

Assume by contradiction that $n + 2$ is indeed a perfect square. Then there should exist another natural number $b \in \mathbb{N}$ such that $b^2 = (n + 2)$ .

Note, that since $(n + 2) > n \ge 0$ , $\sqrt{n + 2} > \sqrt{n}$ . Since $b = \sqrt{n + 2}$ while $a = \sqrt{n}$ , one can conclude that $b > a$ .

Keep in mind that both $a$ and $b$ are natural numbers. The minimum separation between two natural numbers is $1$ . In other words, if $b > a$ , then it must be true that $b \ge a + 1$ .

Take the square of both sides, and the inequality should still be true. (To do so, start by multiplying both sides by $(a + 1)$ and use the fact that $b \ge a + 1$ to make the left-hand side $b^2$ .)

$b^2 \ge (a + 1)^2$ .

Expand the right-hand side using the binomial theorem:

$(a + 1)^2 = a^2 + 2\,a + 1$ .

$b^2 \ge a^2 + 2\,a + 1$ .

However, recall that it was assumed that $a^2 = n$ and $b^2 = n + 2$ . Therefore,

$\underbrace{b^2}_{=n + 2)} \ge \underbrace{a^2}_{=n} + 2\,a + 1$ .

$n + 2 \ge n + 2\, a + 1$ .

Subtract $n + 1$ from both sides of the inequality:

$1 \ge 2\, a$ .

$\displaystyle a \le \frac{1}{2} = 0.5$ .

Recall that $a$ was assumed to be a natural number. In other words, $a \ge 0$ and $a$ must be an integer. Hence, the only possible value of $a$ would be $0$ .

Since $a$ could be equal $0$ , there's not yet a valid contradiction. To produce the contradiction and complete the proof, it would be necessary to show that $a = 0$ just won't work as in the assumption.

If indeed $a = 0$ , then $n = a^2 = 0$ . $n + 2 = 2$ , which isn't a perfect square. That contradicts the assumption that if $n = 0$ is a perfect square, $n + 2 = 2$ would be a perfect square. Hence, by contradiction, one can conclude that

$\text{if $n$ is a perfect square, then $n + 2$ is not a perfect square.}$ .

Note that to produce a more well-rounded proof, it would likely be helpful to go back to the beginning of the proof, and show that $n \ne 0$ . Then one can assume without loss of generality that $n \ne 0$ . In that case, the fact that $\displaystyle a \le \frac{1}{2}$ is good enough to count as a contradiction.

7 0

3 years ago