Difference between revisions of "Main Page"
Borishaase (talk | contribs) (Counter-directional theorem) |
Borishaase (talk | contribs) (Greatest-prime Criterion and Transcendence of Euler's Constant) |
||
Line 1: | Line 1: | ||
__NOTOC__ | __NOTOC__ | ||
= Welcome to MWiki = | = Welcome to MWiki = | ||
− | == | + | == Theorems of the month == |
− | === | + | === Greatest-prime Criterion === |
− | If | + | If a real number may be represented as an irreducible fraction <math>\widehat{ap}b \pm \hat{s}t</math>, where <math>a, b, s</math>, and <math>t</math> are natural numbers, <math>abst \ne 0</math>, <math>a + s > 2</math>, and the (second-)greatest prime number <math>p \in {}^{\omega }\mathbb{P}, p \nmid b</math> and <math>p \nmid s</math>, then <math>r</math> is <math>\omega</math>-transcendental. |
+ | ==== Proof: ==== | ||
+ | The denominator <math>\widehat{ap s} (bs \pm apt)</math> is <math>\ge 2p \ge 2\omega - \mathcal{O}({_e}\omega\sqrt{\omega}) > \omega</math> by the prime number theorem.<math>\square</math> | ||
+ | |||
+ | === Transcendence of Euler's Constant === | ||
+ | |||
+ | For <math>x \in {}^{\omega }{\mathbb{R}}</math>, let be <math>s(x) := \sum\limits_{n=1}^{\omega}{\hat{n}{{x}^{n}}}</math> and <math>\gamma := s(1) - {_e}\omega = \int\limits_{1}^{\omega}{\left( \widehat{\left\lfloor x \right\rfloor} - \hat{x} \right)dx}</math> Euler's constant, where rearranging shows <math>\gamma \in \; ]0, 1[</math>. | ||
− | + | If <math>{_e}\omega = s(\hat{2})\;{_2}\omega</math> is accepted, <math>\gamma \in {}^{\omega }\mathbb{T}_{\mathbb{R}}</math> is true with a precision of <math>\mathcal{O}({2}^{-\omega}\hat{\omega}\;{_e}\omega)</math>. | |
==== Proof: ==== | ==== Proof: ==== | ||
− | + | The (exact) integration of the geometric series yields <math>-{_e}(-\acute{x}) = s(x) + \mathcal{O}(\hat{\omega}{x}^{\grave{\omega}}/\acute{x}) + t(x)dx</math> for <math>x \in [-1, 1 - \hat{\nu}]</math> and <math>t(x) \in {}^{\omega }{\mathbb{R}}</math> such that <math>|t(x)| < {\omega}</math>. | |
+ | |||
+ | After applying Fermat's little theorem to the numerator of <math>\hat{p}(1 - 2^{-p}\,{_2}\omega)</math> for <math>p = \max\, {}^{\omega}\mathbb{P}</math>, the greatest-prime criterion yields the claim.<math>\square</math> | ||
== Recommended reading == | == Recommended reading == |
Revision as of 11:08, 5 September 2020
Welcome to MWiki
Theorems of the month
Greatest-prime Criterion
If a real number may be represented as an irreducible fraction [math]\displaystyle{ \widehat{ap}b \pm \hat{s}t }[/math], where [math]\displaystyle{ a, b, s }[/math], and [math]\displaystyle{ t }[/math] are natural numbers, [math]\displaystyle{ abst \ne 0 }[/math], [math]\displaystyle{ a + s > 2 }[/math], and the (second-)greatest prime number [math]\displaystyle{ p \in {}^{\omega }\mathbb{P}, p \nmid b }[/math] and [math]\displaystyle{ p \nmid s }[/math], then [math]\displaystyle{ r }[/math] is [math]\displaystyle{ \omega }[/math]-transcendental.
Proof:
The denominator [math]\displaystyle{ \widehat{ap s} (bs \pm apt) }[/math] is [math]\displaystyle{ \ge 2p \ge 2\omega - \mathcal{O}({_e}\omega\sqrt{\omega}) > \omega }[/math] by the prime number theorem.[math]\displaystyle{ \square }[/math]
Transcendence of Euler's Constant
For [math]\displaystyle{ x \in {}^{\omega }{\mathbb{R}} }[/math], let be [math]\displaystyle{ s(x) := \sum\limits_{n=1}^{\omega}{\hat{n}{{x}^{n}}} }[/math] and [math]\displaystyle{ \gamma := s(1) - {_e}\omega = \int\limits_{1}^{\omega}{\left( \widehat{\left\lfloor x \right\rfloor} - \hat{x} \right)dx} }[/math] Euler's constant, where rearranging shows [math]\displaystyle{ \gamma \in \; ]0, 1[ }[/math].
If [math]\displaystyle{ {_e}\omega = s(\hat{2})\;{_2}\omega }[/math] is accepted, [math]\displaystyle{ \gamma \in {}^{\omega }\mathbb{T}_{\mathbb{R}} }[/math] is true with a precision of [math]\displaystyle{ \mathcal{O}({2}^{-\omega}\hat{\omega}\;{_e}\omega) }[/math].
Proof:
The (exact) integration of the geometric series yields [math]\displaystyle{ -{_e}(-\acute{x}) = s(x) + \mathcal{O}(\hat{\omega}{x}^{\grave{\omega}}/\acute{x}) + t(x)dx }[/math] for [math]\displaystyle{ x \in [-1, 1 - \hat{\nu}] }[/math] and [math]\displaystyle{ t(x) \in {}^{\omega }{\mathbb{R}} }[/math] such that [math]\displaystyle{ |t(x)| < {\omega} }[/math].
After applying Fermat's little theorem to the numerator of [math]\displaystyle{ \hat{p}(1 - 2^{-p}\,{_2}\omega) }[/math] for [math]\displaystyle{ p = \max\, {}^{\omega}\mathbb{P} }[/math], the greatest-prime criterion yields the claim.[math]\displaystyle{ \square }[/math]