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
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
Math
Appears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3
2×3
2^{34}
234
a_{i-1}
ai−1
\frac{2}{3}
32
\sqrt{2}
2
\sum_{i=1}^3
∑i=13
\sin \theta
sinθ
\boxed{123}
123
Comments
For 1., you can use the fact that if f(x) has a repeated root, then f′(x) has the same root, say a .
This implies that f(a)−f′(a)=0⟹(n−1)!an−1=0⟹a=0. But 0 is obviously not a root of f(x).Therefore, there exists no repeated root of f(x).
For 2, you can see that modulo 2, f(a)≡f(1),f(0)≡1( depending on whether a is odd or even). for all integral a. But, if a integral root b did exist, that would imply that f(b)=0≡0, which leads to a contradiction
We start by inducting on n. Let
fn(x)=k=0∑nk!xk
Let's see the base case, where n=1f1(x)=1+x=0⇒x=−1f1(x) has only 1 root and thus does not have repeated roots.
Let us assume that fn(x)=1+x+2!x2+…+n!xn has no repeated roots.
We now study the function fn+1(x)
fn+1(x)=1+x+2!x2+…+n!xn+(n+1)!xn+1
Observe the derivative of fn+1(x)fn+1′(x)=1+x+2!x2+…+n!xn
Clearly, fn+1′(x) has no repeated roots and must have n distinct roots by our inductive hypothesis. Therefore, by Rolle's Theorem, we must have n+1 distinct roots of fn+1(x). And thus proved.
The first one is pretty simple. I don't like using LMV or Rolle's theorem, or at least their terms in anything that can be solved with a rough sketch. Although I don't use it, my method is pretty much related to it. If the function has repeated roots, then it's derivative also has a root at that point. If that's the case, then the xn/n! factor in the function has no consequence in altering the value taken by the function. In that case, x must have a repeated root at 0. But substituting 0 in the place of x gives you 1. So 0 is not a root and the function doesn't have any repeated roots.
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
For 1., you can use the fact that if f(x) has a repeated root, then f′(x) has the same root, say a .
This implies that f(a)−f′(a)=0⟹(n−1)!an−1=0⟹a=0. But 0 is obviously not a root of f(x).Therefore, there exists no repeated root of f(x).
For 2, you can see that modulo 2, f(a)≡f(1),f(0)≡1( depending on whether a is odd or even). for all integral a. But, if a integral root b did exist, that would imply that f(b)=0≡0, which leads to a contradiction
Log in to reply
Ya. I used the exact same methods for both the questions. Great minds think alike ; )
Let us assume that fn(x)=1+x+2!x2+…+n!xn has no repeated roots.
We now study the function fn+1(x)
fn+1(x)=1+x+2!x2+…+n!xn+(n+1)!xn+1
Observe the derivative of fn+1(x) fn+1′(x)=1+x+2!x2+…+n!xn
Clearly, fn+1′(x) has no repeated roots and must have n distinct roots by our inductive hypothesis. Therefore, by Rolle's Theorem, we must have n+1 distinct roots of fn+1(x). And thus proved.
@arian tashakkor
Log in to reply
ok these ones are somewhat hard to understand I should say ...
Log in to reply
I've posted some more proof notes.
The first one can be done with the help of LMV or Rolles i guess??
Log in to reply
The first one is pretty simple. I don't like using LMV or Rolle's theorem, or at least their terms in anything that can be solved with a rough sketch. Although I don't use it, my method is pretty much related to it. If the function has repeated roots, then it's derivative also has a root at that point. If that's the case, then the xn/n! factor in the function has no consequence in altering the value taken by the function. In that case, x must have a repeated root at 0. But substituting 0 in the place of x gives you 1. So 0 is not a root and the function doesn't have any repeated roots.