Ask your own question, for FREE!
Mathematics 6 Online
OpenStudy (rsadhvika):

show that \(e\) is irrational

OpenStudy (rsadhvika):

need help understanding the Fourier's proof

OpenStudy (rsadhvika):

I got the bounded part : 2 < e < 3

OpenStudy (rsadhvika):

i feel lost from the step of letting e = a/b

OpenStudy (anonymous):

dont listein to her wikipedia is not a good site to use most of it stuff is wrong

OpenStudy (zarkon):

the proof is correct...what exactly are you confused on?

OpenStudy (rsadhvika):

\[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 ?

OpenStudy (rsadhvika):

\[e = b! \left(\color{red}{\frac{a}{b}} - S_b\right)\] we cannot conclude the proof if we assume e = p/q right ?

OpenStudy (rsadhvika):

because we wont know if `q | b!` or not

OpenStudy (rsadhvika):

@Zarkon

OpenStudy (rsadhvika):

** tail of series \[x = b! \left(e - S_b\right)\]

OpenStudy (zarkon):

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

OpenStudy (zarkon):

a/b or p/q...what does it matter what we call the fraction?

OpenStudy (rsadhvika):

yeah it doesn't matter but why are they using same variable for both n'th partial sum and e ?

OpenStudy (rsadhvika):

the denominator of `e` could be something different from the index in `b`'th partial sum right ?

OpenStudy (zarkon):

they can define x anyway they want. with this version of x we get our contradiction

OpenStudy (rsadhvika):

Oh they are comparing partial sum based on the denominator of e is it ?

OpenStudy (zarkon):

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

OpenStudy (rsadhvika):

Wow! I see.. got it! xD thanks @Zarkon

OpenStudy (rsadhvika):

\[ 0 \lt b!(e-S_b) \lt \dfrac{1}{b} \]

OpenStudy (rsadhvika):

\[ 0 \lt b!(\frac{a}{b}-S_b) \lt \dfrac{1}{b} \] \[ 0 \lt \text{integer}\lt \dfrac{1}{b} \] contradiction

OpenStudy (zarkon):

and \[\frac{1}{b}<1\]

OpenStudy (rsadhvika):

Indeed, b/c the index b is >=1

OpenStudy (zarkon):

\[0 \lt \text{integer}\lt \dfrac{1}{b}<1\] so \[0 \lt \text{integer}\lt 1\]

OpenStudy (rsadhvika):

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

OpenStudy (zarkon):

that is in the proof... "Note that b couldn't be equal to one as e is not an integer"

OpenStudy (rsadhvika):

yes! I see showing 2 < e < 3 is also the key step in the proof

OpenStudy (ikram002p):

i like this proof xD

OpenStudy (ikram002p):

do u still trying to understand ?

OpenStudy (rsadhvika):

understood it in bits and pieces.. need to go over it one more time

OpenStudy (rsadhvika):

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 :)

OpenStudy (ikram002p):

yeah it is ^_^

OpenStudy (rsadhvika):

** 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

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!