No Arabic abstract
In this note we study the flint hill series of the form begin{align} sum limits_{n=1}^{infty}frac{1}{(sin^2n) n^3} onumber end{align}via a certain method. The method works essentially by erecting certain pillars sufficiently close to the terms in the series and evaluating the series at those spots. This allows us to relate the convergence and the divergence of the series to other series that are somewhat tractable. In particular we show that the convergence of the flint hill series relies very heavily on the condition that for any small $epsilon>0$ begin{align} bigg|sum limits_{i=0}^{frac{n+1}{2}}sum limits_{j=0}^{i}(-1)^{i-j}binom{n}{2i+1} binom{i}{j}bigg|^{2s} leq |(sin^2n)|n^{2s+2-epsilon} onumber end{align}for some $sin mathbb{N}$.
The aim of this paper is to provide a new class of series identities in the form of four general results. The results are established with the help of generalizatons of the classical Kummers summation theorem obtained earlier by Rakha and Rathie. Results obtained earlier by Srivastava, Bailey and Rathie et al. follow special cases of our main findings.
This paper focuses on the equivalent expression of fractional integrals/derivatives with an infinite series. A universal framework for fractional Taylor series is developed by expanding an analytic function at the initial instant or the current time. The framework takes into account of the Riemann-Liouville definition, the Caputo definition, the constant order and the variable order. On this basis, some properties of fractional calculus are confirmed conveniently. An intuitive numerical approximation scheme via truncation is proposed subsequently. Finally, several illustrative examples are presented to validate the effectiveness and practicability of the obtained results.
In 2008 I thought I found a proof of the Riemann Hypothesis, but there was an error. In the Spring 2020 I believed to have fixed the error, but it cannot be fixed. I describe here where the error was. It took me several days to find the error in a careful checking before a possible submission to a payable review offered by one leading journal. There were three simple lemmas and one simple theorem, all were correct, yet there was an error: what Lemma 2 proved was not exactly what Lemma 3 needed. So, it was the connection of the lemmas. This paper came out empty, but I have found a different proof of the Riemann Hypothesis and it seems so far correct. In the discussion at the end of this paper I raise a matter that I think is of importance to the review process in mathematics.
The theory of colorful graphs can be developed by working in Galois field modulo (p), p > 2 and a prime number. The paper proposes a program of possible conversion of graph theory into a pleasant colorful appearance. We propose to paint the usual black (indicating presence of an edge) and white (indicating absence of an edge) edges of graphs using multitude of colors and study their properties. All colorful graphs considered here are simple, i.e. not having any multiple edges or self-loops. This paper is an invitation to the program of generalizing usual graph theory in this direction.
If A is infinite and well-ordered, then |2^A|<=|Part(A)|<=|A^A|.