show that \(e\) is irrational
need help understanding the Fourier's proof
I got the bounded part : 2 < e < 3
i feel lost from the step of letting e = a/b
dont listein to her wikipedia is not a good site to use most of it stuff is wrong
the proof is correct...what exactly are you confused on?
\[e = b! \left(e - S_b\right)\] i have managed to digest this far, after this, why are they assuming e = a/b instead of some other different fraction like p/q ?
\[e = b! \left(\color{red}{\frac{a}{b}} - S_b\right)\] we cannot conclude the proof if we assume e = p/q right ?
because we wont know if `q | b!` or not
@Zarkon
** tail of series \[x = b! \left(e - S_b\right)\]
this is a proof by contradiction...we assume e=a/b and reach a contradiction. Therefore e cant be written as a fraction. therefore it is irrational
a/b or p/q...what does it matter what we call the fraction?
yeah it doesn't matter but why are they using same variable for both n'th partial sum and e ?
the denominator of `e` could be something different from the index in `b`'th partial sum right ?
they can define x anyway they want. with this version of x we get our contradiction
Oh they are comparing partial sum based on the denominator of e is it ?
assuming e=a/b they are constructing a number x that is both an integer and not an integer at the same time. this is a contadiction
Wow! I see.. got it! xD thanks @Zarkon
\[ 0 \lt b!(e-S_b) \lt \dfrac{1}{b} \]
\[ 0 \lt b!(\frac{a}{b}-S_b) \lt \dfrac{1}{b} \] \[ 0 \lt \text{integer}\lt \dfrac{1}{b} \] contradiction
and \[\frac{1}{b}<1\]
Indeed, b/c the index b is >=1
\[0 \lt \text{integer}\lt \dfrac{1}{b}<1\] so \[0 \lt \text{integer}\lt 1\]
i think we can let b > 1 in e = a/b since e was "proven" to be between 2 and 3 and so is not an integer
that is in the proof... "Note that b couldn't be equal to one as e is not an integer"
yes! I see showing 2 < e < 3 is also the key step in the proof
i like this proof xD
do u still trying to understand ?
understood it in bits and pieces.. need to go over it one more time
e = a/b the difference between b'th partial sum and e when multiplied by b! gives an integer eventhough it is bounded between 0 and 1/b. really a nice argument :)
yeah it is ^_^
** e = a/b the difference between b'th partial sum and e when multiplied by b! gives an integer eventhough it is bounded between 0 and 1/b. which is a contradiction because there are no integers between 0 and 1/b
Join our real-time social learning platform and learn together with your friends!