Ask question

Ask question

All categories

2 years ago

7

What the answer for that

1 answer:

telo118 [61]2 years ago

3 0

1. Always true. 1+1=2
2. Always true. 1+e is irrational.
3. Sometimes true. e + (-e) = 0 which is rational.
4. Always true. 1*1 = 1
5. Sometimes true. 0*e = 0 which is rational.
6. Sometimes true. Sqrt(2) * sqrt(2) = 2 which is rational.

The question asked for an example to support your answer, but none of the answers can be proven with just one example. The answers which are sometimes true need 2 examples to be proven, and the answers which are always true cannot be proven by example.

You might be interested in

Which point is located at (0.25,-0.5) point A O point O point R

pav-90 [236]

Answer:

• point C

Step-by-step explanation:

______________

4 0

2 years ago

Read 2 more answers

Does anybody know the answer to this ?

melisa1 [442]

Answer:

Step-by-step explanation:

5 0

3 years ago

If f(x) = 4(3x - 5), find f^-1(x)

Sloan [31]

Answer:

The answer is A.

Step-by-step explanation:

Lets call f(x)=y, so y= 4*(3*x-5), we want to find 'x', using 'y' as a the variable.

$y=12x-20\\ y+20=12x\\ x=\frac{y+20}{12}$

Now lets change the name of 'y' to 'x', and 'x' to f^-1(x).

f-1(x) = (x+20)/12

3 0

3 years ago

Find the smallest positive $n$ such that \begin{align*} n &\equiv 3 \pmod{4}, \\ n &\equiv 2 \pmod{5}, \\ n &\equiv

Alex777 [14]

4, 5, and 7 are mutually coprime, so you can use the Chinese remainder theorem right away.

We construct a number $x$ such that taking it mod 4, 5, and 7 leaves the desired remainders:

$x=3\cdot5\cdot7+4\cdot2\cdot7+4\cdot5\cdot6$

Taken mod 4, the last two terms vanish and we have

$x\equiv3\cdot5\cdot7\equiv105\equiv1\pmod4$

so we multiply the first term by 3.

Taken mod 5, the first and last terms vanish and we have

$x\equiv4\cdot2\cdot7\equiv51\equiv1\pmod5$

so we multiply the second term by 2.

Taken mod 7, the first two terms vanish and we have

$x\equiv4\cdot5\cdot6\equiv120\equiv1\pmod7$

so we multiply the last term by 7.

Now,

$x=3^2\cdot5\cdot7+4\cdot2^2\cdot7+4\cdot5\cdot6^2=1147$

By the CRT, the system of congruences has a general solution

$n\equiv1147\pmod{4\cdot5\cdot7}\implies\boxed{n\equiv27\pmod{140}}$

or all integers $27+140k$ , $k\in\mathbb Z$ , the least (and positive) of which is 27.

3 0

2 years ago

likoan [24]

24 pie and now they want me to explain but I don’t want to

4 0

2 years ago

Read 2 more answers