Related papers: How to compute $\sum 1/n^2$ by solving triangles
We find the closest approximation to 1 from below using a sum of $n$ Egyptian fractions.
We discuss alternative iteration methods for differential equations. We provide a convergence proof for exactly solvable examples and show more convenient formulas for nontrivial problems.
A determined algorithm is presented for solving the rSUM problem for any natural r with a sub-quadratic assessment of time complexity in some cases. In terms of an amount of memory used the obtained algorithm is the nlog^3(n) order. The…
A novel tensor-based formula for solving the linear systems involving Kronecker sum is proposed. Such systems are directly related to the matrix and tensor forms of Sylvester equation. The new tensor-based formula demonstrates the…
We present a new method, in the following called MMM2D, to accurately calculate the electrostatic energy and forces on charges being distributed in a two dimensional periodic array of finite thickness. It is not based on an Ewald summation…
In this study, a new form of quadratic spline is obtained, where the coefficients are determined explicitly by variational methods. Convergence is studied and parity conservation is demonstrated. Finally, the method is applied to solve…
We outline a new algorithm to solve coupled systems of differential equations in one continuous variable $x$ (resp. coupled difference equations in one discrete variable $N$) depending on a small parameter $\epsilon$: given such a system…
By systematically applying ten inequivalent two-part relations between hypergeometric sums 3F2(1) to the published database of all such sums, 66 new sums are obtained. Many results extracted from the literature are shown to be special cases…
Classical problem of random triangle in square is solved by simple and transparent geometrical method.
In this thesis, a new class of algorithms based on Sums of Squares Programming is developed. These allow to reduce a degree-$d$ homogeneous polynomial $T = \sum_{i = 1}^m \langle a_i, X \rangle^d $ to a quadratic form being close to a…
In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…
We present a general method for handling problems that ask for the equidistribution of solutions to equations involving $m^2+n^2$, and illustrate it by considering $p+m^2+n^2=N$.
We describe an explicit algorithm to factorize an even antisymmetric N^2 matrix into triangular and trivial factors. This allows for a straight forward computation of Pfaffians (including their signs) at the cost of N^3/3 flops.
We find a new method for looking for the static and spherically symmetric solutions in $F(R)$ theory of gravity. With this method, a number of new solutions in terms of the analytic functions are obtained. We hope this investigation may be…
This paper is concerned with the problem of finding $n$ distinct squares such that, on excluding any one of them, the sum of the remaining $n-1$ squares is a square. While parametric solutions are known when $n=3$ and $n=4$, when $n > 4$,…
The Bernoulli numbers b_0,b_1,b_2,.... of the second kind are defined by \sum_{n=0}^\infty b_nt^n=\frac{t}{\log(1+t)}. In this paper, we give an explicit formula for the sum \sum_{j_1+j_2+...+j_N=n,…
In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. In a recent series of papers, we have studied methods to break value symmetries. Our results…
In this article, we present a geometrical proof of sum of $\cos n\varphi$ where $n$ goes from $1$ up to $m$. Although there exist some summation forms and the proofs are simple, they use complex numbers. Our proof comes from a geometrical…