Main Page

From MWiki
Revision as of 08:07, 1 October 2022 by Borishaase (talk | contribs) (Greatest-prime Criterion and Transcendence of Euler's Constant)
Jump to: navigation, search

Welcome to MWiki

Theorems of the month

Greatest-prime Criterion

If a real number may be represented as an irreducible fraction [math]\displaystyle{ \widetilde{ap}b \pm \tilde{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{ \widetilde{ap s} (bs \pm apt) }[/math] is [math]\displaystyle{ \ge \hat{p} \ge \hat{\omega} - \mathcal{O}({_e}\omega{\omega}^{\tilde{2}}) > \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) := {+}_{n=1}^{\omega}{\tilde{n}{{x}^{n}}} }[/math] and [math]\displaystyle{ \gamma := s(1) - {_e}\omega = {\uparrow}_{1}^{\omega}{\left( \widetilde{\left\lfloor x \right\rfloor} - \tilde{x} \right)\downarrow x} }[/math] Euler's constant, where rearranging shows [math]\displaystyle{ \gamma \in \; ]0, 1[ }[/math].

If [math]\displaystyle{ {_e}\omega = s(\tilde{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}\tilde{\omega}\;{_e}\omega) }[/math].

Proof:

The (exact) integration of the geometric series yields [math]\displaystyle{ -{_e}(-\acute{x}) = s(x) + \mathcal{O}(\tilde{\omega}{x}^{\grave{\omega}}/\acute{x}) + t(x)dx }[/math] for [math]\displaystyle{ x \in [-1, 1 - \tilde{\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{ \tilde{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]

Recommended reading

Nonstandard Mathematics