Problems – Page 3 – We Solve Problem
Filter Problems
Showing 41 to 60 of 103 entries

#### Examples and counterexamples. Constructive proofs , Pigeonhole principle (other) , Theory of algorithms (other)

The triangle $C_1C_2O$ is given. Within it the bisector $C_2C_3$ is drawn, then in the triangle $C_2C_3O$ – bisector $C_3C_4$ and so on. Prove that the sequence of angles $γ_n$ = $C_{n + 1}C_nO$ tends to a limit, and find this limit if $C_1OC_2$ = α.

#### Examples and counterexamples. Constructive proofs , Pigeonhole principle (other) , Theory of algorithms (other)

Cut the interval [-1, 1] into black and white segments so that the integrals of any a$)$ linear function; b$)$ a square trinomial in white and black segments are equal.

#### Examples and counterexamples. Constructive proofs , Pigeonhole principle (other) , Theory of algorithms (other)

a$)$ Using geometric considerations, prove that the base and the side of an isosceles triangle with an angle of 36 $^{\circ}$ at the vertex are incommensurable.

b$)$ Invent a geometric proof of the irrationality of $\sqrt{2}$.

#### Examples and counterexamples. Constructive proofs , Pigeonhole principle (other) , Theory of algorithms (other)

Let f $(x)$ be a polynomial of degree n with roots $α_1$, …, $α_n$. We define the polygon M as the convex hull of the points $α_1$, …, $α_n$ on the complex plane. Prove that the roots of the derivative of this polynomial lie inside the polygon M.

#### Examples and counterexamples. Constructive proofs , Pigeonhole principle (other) , Theory of algorithms (other)

Let f $(x)$ = $(x – a)$ $(x – b)$ $(x – c)$ be a polynomial of the third degree with complex roots a, b, c.
Prove that the roots of the derivative of this polynomial lie inside the triangle with vertices at the points a, b, c.

#### Examples and counterexamples. Constructive proofs , Pigeonhole principle (other) , Theory of algorithms (other)

Using the theorem on rational roots of a polynomial $($ see Problem 61013 $)$, prove that if p / q is rational and cos $(p / q)$ $^{\circ}$ ≠ 0, ± 1, ± 1, then
cos $(p / q)$ $^{\circ}$ is irrational.

#### Examples and counterexamples. Constructive proofs , Pigeonhole principle (other) , Theory of algorithms (other)

It is known that cos α$^{\circ}$ = 1/3. Is α a rational number?

#### Examples and counterexamples. Constructive proofs , Pigeonhole principle (other) , Theory of algorithms (other)

Prove that there are infinitely many composite numbers among the numbers [$2^k$ $\sqrt{2}$] $(k = 0, 1, …)$.

#### Theory of algorithms (other)

Solve problem number 108736 for the inscription A, BC, DEF, CGH, CBE, EKG.

#### Examples and counterexamples. Constructive proofs , Pigeonhole principle (other) , Theory of algorithms (other)

$x_1$ is the real root of the equation $x^2$ + ax + b = 0, $x_2$ is the real root of the equation $x^2$ – ax – b = 0.
Prove that the equation $x^2$ + 2ax + 2b = 0 has a real root, enclosed between $x_1$ and $x_2$. $($ a and b are real numbers $)$.

#### Iterations , Mathematical induction (other) , Processes and operations , Rational and irrational numbers , Theory of algorithms (other)

With a non-zero number, the following operations are allowed: $x \rightarrow \frac{1+x}{x}, x \rightarrow \frac{1-x}{x}$. Is it true that from every non-zero rational number one can obtain each rational number with the help of a finite number of such operations?

My Problem Set reset
No Problems selected