Maths Olympiad Prep

Library / /433 of 520

Algebra Difficulty 6.0 National olympiad Prove it

Prove the following propositions:

1. xR,x28x+17>0\forall x \in \mathbb{R}, x^{2}-8 x+17>0.
2. xR,(x+2)2(x3)20x12\forall x \in \mathbb{R},(x+2)^{2}-(x-3)^{2} \geq 0 \Rightarrow x \geq \frac{1}{2}.
3. nN,116n27\exists n \in \mathbb{N}, 11 \mid 6 n^{2}-7.

Solution

1. For all real xx, we have: x28x+17=(x4)2+1x^{2}-8 x+17=(x-4)^{2}+1. Since (x4)20(x-4)^{2} \geq 0, it follows that (x4)2+11(x-4)^{2}+1 \geq 1, hence for all real xx, x28x+17>0x^{2}-8 x+17>0.

2. Suppose that (x+2)2(x3)20(x+2)^{2}-(x-3)^{2} \geq 0. We write: (x+2)2(x3)2=5(2x1)(x+2)^{2}-(x-3)^{2}=5(2 x-1) (third remarkable identity).

Thus, we have: 5(2x1)05(2 x-1) \geq 0 so 2x102 x-1 \geq 0 (since 5>05>0). Therefore, x12x \geq \frac{1}{2}.

3. For n=5,6n27=6×257=141=11×13n=5, 6 n^{2}-7=6 \times 25-7=141=11 \times 13. Therefore, we have shown that there exists at least one natural number nn such that 11 divides 6n276 n^{2}-7.

## 2 Tuesday afternoon, 18th: Cécile Gachet

Introduction. This course provides exercises on the application of simple induction, and then presents some variants: double induction or more generally of order kNk \in \mathbb{N}^{*}, strong induction, and descending induction. Finally, the related principle of infinite descent is briefly explained.

Let's start with some exercises to check that everything is fine with simple induction:

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.