Polynomial, Vietnam MO 2014 Problem 2

Join Trial or Access Free Resources
[et_pb_section fb_built="1" _builder_version="3.22.4"][et_pb_row _builder_version="3.25"][et_pb_column type="4_4" _builder_version="3.25" custom_padding="|||" custom_padding__hover="|||"][et_pb_text _builder_version="3.27.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" custom_padding="20px|20px|20px|20px" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3"]

Understand the problem

[/et_pb_text][et_pb_text _builder_version="4.0" text_font="Raleway||||||||" background_color="#f4f4f4" custom_margin="10px||10px" custom_padding="10px|20px|10px|20px" hover_enabled="0" box_shadow_style="preset2"]Given the polynomial $P(x)=(x^2-7x+6)^{2n}+13$ where $n$ is a positive integer. Prove that $P(x)$ can't be written as a product of $n+1$ non-constant polynomials with integer coefficients. [/et_pb_text][/et_pb_column][/et_pb_row][et_pb_row _builder_version="3.25"][et_pb_column type="4_4" _builder_version="3.25" custom_padding="|||" custom_padding__hover="|||"][et_pb_accordion open_toggle_text_color="#0c71c3" _builder_version="3.22.4" toggle_font="||||||||" body_font="Raleway||||||||" text_orientation="center" custom_margin="10px||10px" hover_enabled="0"][et_pb_accordion_item title="Source of the problem" open="on" _builder_version="4.0" hover_enabled="0"]Vietnam MO 2014 Problem 2 [/et_pb_accordion_item][et_pb_accordion_item title="Topic" _builder_version="4.0" hover_enabled="0" open="off"]Polynomial, Algebra [/et_pb_accordion_item][et_pb_accordion_item title="Difficulty Level" _builder_version="4.0" hover_enabled="0" open="off"]7/10 [/et_pb_accordion_item][et_pb_accordion_item title="Suggested Book" _builder_version="4.0" hover_enabled="0" open="off"]Excursion in Mathematics by Bhaskaracharya Prathistan [/et_pb_accordion_item][/et_pb_accordion][et_pb_text _builder_version="3.27.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" custom_margin="48px||48px" custom_padding="20px|20px|20px|20px" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3"]

Start with hints

[/et_pb_text][et_pb_tabs active_tab_background_color="#0c71c3" inactive_tab_background_color="#000000" _builder_version="3.22.4" tab_text_color="#ffffff" tab_font="||||||||" background_color="#ffffff" hover_enabled="0"][et_pb_tab title="Hint 0" _builder_version="3.22.4"]Do you really need a hint? Try it first!

[/et_pb_tab][et_pb_tab title="Hint 1" _builder_version="4.0" hover_enabled="0"]The idea is that if a polynomial can be factorized, then we must check if a polynomial has real roots or not.The first observation is that the given polynomial is always > 0 as it is of the form \( (f(x))^2 + 13 \).Hence, it has no real roots.So, if the polynomial can be factorized, then obviously the factors will not be linear. An odd degree polynomial has atleast one real root. Hence, none of the factors will be odd degree. [/et_pb_tab][et_pb_tab title="Hint 2" _builder_version="4.0" hover_enabled="0"]So, we have seen the factors will not be linear. Hence, let's investigate the factors and their properties if the polynomial can be factorized.Let us approach the method of contradiction.Assume that the polynomial can be factorized into n+1 factors with integer coefficients.Now, we know that the factors must have atleast degree 2, in fact only even degrees i.e. 2, 4, 6, ...Now, let's see if all the factors have a degree more than 2, then the degree of the whole polynomial must be \( \geq 4n + 4 \), but the degree of the polynomial is 4n.So, two of the factors must be of degree 2. [/et_pb_tab][et_pb_tab title="Hint 3" _builder_version="4.0" hover_enabled="0"]Hence there exist $a,b, c, d$ such that $(x^2+ax+b)(x^2+cx+d) \mid  P(x)$.Note that $f(x)=x^2+ax+b > 0$ and $g(x)=x^2+cx+d  > 0$ for all $x \in \mathbb R$, because they cannot have a real root.Now, we have to make use of the idea that the coefficients are integers. So, some idea of divisibility must come in.The given polynomial is $P(x)=(x^2-7x+6)^{2n}+13$ .Try to find out some values of x, for which P(x) is easily determined without n.See, x = 1 and 6 works as \( x^2 - 7x + 6 = (x-1)(x-6) \).  [/et_pb_tab][et_pb_tab title="Hint 4" _builder_version="4.0" hover_enabled="0"]So, we saw that x = 1 and x = 6 are good values and we get that P(1) = P(6) = 13.Also, we know that f(1).g(1) | P(1) = 13. So, one of them must be 1.Say, f(1) = 1 = 1 + a + b. Also, f(6) = 36 + 6a - a = 36 + 5a. Now, f(6) | P(6) = 13. So, f(6) = 36 + 5a = 1 or 13. This gives rise to a single case of a = -7; where \( f(x) = x^2 -7x + 7\).But f(x) has real roots implying that P(x) has real roots. Hence contradiction.QED.  [/et_pb_tab][/et_pb_tabs][et_pb_text _builder_version="3.27.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" custom_margin="48px||48px" custom_padding="20px|20px|20px|20px" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3"]

Watch video

[/et_pb_text][et_pb_code _builder_version="3.26.4"]
[/et_pb_code][et_pb_text _builder_version="3.27.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" min_height="12px" custom_margin="50px||50px" custom_padding="20px|20px|20px|20px" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3"]

Connected Program at Cheenta

[/et_pb_text][et_pb_blurb title="Math Olympiad Program" url="https://cheenta.com/matholympiad/" url_new_window="on" image="https://cheenta.com/wp-content/uploads/2018/03/matholympiad.png" _builder_version="3.23.3" header_font="||||||||" header_text_color="#e02b20" header_font_size="48px" link_option_url="https://cheenta.com/matholympiad/" link_option_url_new_window="on"]

Math Olympiad is the greatest and most challenging academic contest for school students. Brilliant school students from over 100 countries participate in it every year.Cheenta works with small groups of gifted students through an intense training program. It is a deeply personalized journey toward intellectual prowess and technical sophistication.[/et_pb_blurb][et_pb_button button_url="https://cheenta.com/matholympiad/" url_new_window="on" button_text="Learn More" button_alignment="center" _builder_version="3.23.3" custom_button="on" button_bg_color="#0c71c3" button_border_color="#0c71c3" button_border_radius="0px" button_font="Raleway||||||||" button_icon="%%3%%" background_layout="dark" button_text_shadow_style="preset1" box_shadow_style="preset1" box_shadow_color="#0c71c3"][/et_pb_button][et_pb_text _builder_version="3.27.4" text_font="Raleway|300|||||||" text_text_color="#ffffff" header_font="Raleway|300|||||||" header_text_color="#e2e2e2" background_color="#0c71c3" custom_margin="50px||50px" custom_padding="20px|20px|20px|20px" border_radii="on|5px|5px|5px|5px" box_shadow_style="preset3"]

Similar Problems

[/et_pb_text][et_pb_post_slider include_categories="9" _builder_version="3.22.4"][/et_pb_post_slider][et_pb_divider _builder_version="3.22.4" background_color="#0c71c3"][/et_pb_divider][/et_pb_column][/et_pb_row][/et_pb_section]
More Posts
ISI M.Stat Entrance Success Story 2026

ISI M.Stat Entrance Success Story 2026

June 27, 2026

In 2026, the following Cheenta students have been successful for Indian Statistical Institute's M.Stat Entrance. They ranked within the first 50 in the entire country in these entrances. I.S.I. M.Stat Entrance

Read More
ISI B.Stat-B.Math and CMI BSc. Math Entrance Success Story 2026

ISI B.Stat-B.Math and CMI BSc. Math Entrance Success Story 2026

In 2026, the following Cheenta students have been successful for Indian Statistical Institute's B.Stat Entrance and Chennai Mathematical Institute's B.Sc. Math Entrance. They ranked within the first 200 in the entire country in these entrances. Most of these students attended the problem solving workshops regularly, which happen 5 days every week. CMI B.Sc. Math Entrance […]

Read More
8 Cheenta students cracked the Regional Math Olympiad 2025 

8 Cheenta students cracked the Regional Math Olympiad 2025 

December 26, 2025

In 2025, 8 students from Cheenta Academy cracked the prestigious Regional Math Olympiad. In this post, we will share some of their success stories and learning strategies. The Regional Mathematics Olympiad (RMO) and the Indian National Mathematics Olympiad (INMO) are two most important mathematics contests in India.These two contests are for the students who are […]

Read More
Cheenta Students Shine at IOQM 2025

Cheenta Students Shine at IOQM 2025

October 26, 2025

Cheenta Academy proudly celebrates the success of 27 current and former students who qualified for the Indian Olympiad Qualifier in Mathematics (IOQM) 2025, advancing to the next stage — RMO. This accomplishment highlights their perseverance and Cheenta’s ongoing mission to nurture mathematical excellence and research-oriented learning.

Read More

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.

© 2010 - 2025, Cheenta Academy. All rights reserved.
linkedin facebook pinterest youtube rss twitter instagram facebook-blank rss-blank linkedin-blank pinterest youtube twitter instagram