اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEuler and the Multiplication Formula for the Gamma Function
63
0
0.0
(
0
)
تأليف
Alexander Aycock
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We show that an apparently overlooked result of Euler from cite{E421} is essentially equivalent to the general multiplication formula for the $Gamma$-function that was proven by Gauss in cite{Ga28}.
قيم البحث
اقرأ أيضاً
We review Eulers idea on the Gammafunction. We will explain, how Euler obtained them and how Eulers ideas anticipate more modern approaches and theories. Furthermore, some questions asked by Euler are answered.
Recently the media broadcast the news, together with illustrative videos, of a so-called Japanese method to perform multiplication by hand without using the multiplication tables. Goodbye multiplication tables was the headline of several websites, in
cluding important ones, where news are however too often `re-posted uncritically. The easy numerical examples could induce naive internauts to believe that, in a short future, multiplications could be really done without the knowledge of multiplication tables. This is what a girl expresses, with great enthusiasm, to her father. The dialogues described here, although not real, are likely and have been inspired by this episode, being Maddalena the daughter of the author. Obviously the revolutionary value of the new method is easily disassembled, while its educational utility is highlighted to show (or remember) the reasoning on which the method learned in elementary school is based, although mostly applied mechanically.
We give a local Euler-Maclaurin formula for rational convex polytopes in a rational euclidean space . For every affine rational polyhedral cone C in a rational euclidean space W, we construct a differential operator of infinite order D(C) on W with c
onstant rational coefficients, which is unchanged when C is translated by an integral vector. Then for every convex rational polytope P in a rational euclidean space V and every polynomial function f (x) on V, the sum of the values of f(x) at the integral points of P is equal to the sum, for all faces F of P, of the integral over F of the function D(N(F)).f, where we denote by N(F) the normal cone to P along F.
The Hardy-Ramanujan formula for the number of integer partitions of $n$ is one of the most popular results in partition theory. While the unabridged final formula has been celebrated as reflecting the genius of its authors, it has become all too comm
on to attribute either some simplified version of the formula which is not as ingenious, or an alternative more elegant version which was expanded on afterwards by other authors. We attempt to provide a clear and compelling justification for distinguishing between the various formulas and simplifications, with a summarizing list of key take-aways in the final section.
We define evaluation forms associated to objects in a module subcategory of Ext-symmetry generated by finitely many simple modules over a path algebra with relations and prove a multiplication formula for the product of two evaluation forms. It is an
alogous to a multiplication formula for the product of two evaluation forms associated to modules over a preprojective algebra given by Geiss, Leclerc and Schroer in cite{GLS2006}.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
