Find the number of integers or find all integers for which x2+bx+c becomes a perfect square of an integer, where b,c are integers.I think this would be very tough as we are not given any information about b,c.What do you think.?
This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.
When posting on Brilliant:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
As Tim pointed out, there the class of functions of perfect square polynomials yield infinitely many perfect square values. For all of the other cases, there are finitely many solutions.
To deal with the general case, you want to bound x2+bx+c strictly between 2 consecutive squares, for all but finitely many values of x. The squares (x+⌊2b⌋)2 and (x+⌈2b⌉)2 should work.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
If c=(2b)2, then
x2+bx+c=x2+2⋅2b⋅x+(2b)2=(x+2b)2.
So, if (b,c)∈{…,(−6,9),(−4,4),(−2,1),(0,0),(2,1),(4,4),(6,9),…},
then it is a perfect square for all x∈Z. Furthermore, if c is a perfect square, then x=0 always yields a perfect square, regardless of b.
I'd say those are the special cases. I wouldn't know a general way to find all perfect squares for some integers b,c.
Log in to reply
Thnx,I also think that it is very tough.But it would be very helpful if we get some general results...
As Tim pointed out, there the class of functions of perfect square polynomials yield infinitely many perfect square values. For all of the other cases, there are finitely many solutions.
To deal with the general case, you want to bound x2+bx+c strictly between 2 consecutive squares, for all but finitely many values of x. The squares (x+⌊2b⌋)2 and (x+⌈2b⌉)2 should work.