Related papers: How to compute $\sum 1/n^2$ by solving triangles
We present a, hopefully, elementary mathematical treatment of the computational aspects of congruent numbers, such that an amateur could understand the problem and perform their own calculations.
This paper offers a solution method that allows one to find exact values for a large class of convergent series of rational terms. Sums of this form arise often in problems dealing with Quantum Field Theory.
In this article, we provide a new elementary proof of the Basel problem.
Finite trigonometric sums occur in various branches of physics, mathematics, and their applications. These sums may contain various powers of one or more trigonometric functions. Sums with one trigonometric function are known, however sums…
We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…
The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…
We developpe a direct sum decomposition for n-dual spaces.
Let $\mathbb{N}_0$ be a class of natural numbers whose binary decompositions has even number of 1. We estimate of the sum $\sum\limits_{n\in \mathbf{N}_0,n\le X}\exp(2\pi i \alpha n^2)$.
In this article a new method of generating sums of like powers is presented.
Given a set (or multiset) S of n numbers and a target number t, the subset sum problem is to decide if there is a subset of S that sums up to t. There are several methods for solving this problem, including exhaustive search,…
We evaluate in closed form several classes of finite trigonometric sums. Two general methods are used. The first is new and involves sums of roots of unity. The second uses contour integration and extends a previous method used by two of…
This paper gives new explicit formulas for sums of powers of integers and their reciprocals.
An algorithm is presented to compute isolated values of the divisor summatory function in O(n^(1/3)) time and O (log n) space. The algorithm is elementary and uses a geometric approach of successive approximation combined with coordinate…
We compute the sum and the alternating sum of the reciprocals of triangular numbers using two standard methods from calculus: a telescoping series approach and a power series approach. We then extend these results to generalized…
Let $\tau_3(n)$ be the triple divisor function which is the number of solutions of the equation $d_1d_2d_3=n$ in natural numbers. It is shown that $$ \sum_{1\leq n_1,n_2,n_3\leq \sqrt{x}}\tau_3(n_1^2+n_2^2+n_3^2)=c_1x^{\frac{3}{2}}(\log…
In this note, we give a simple method for computing the column sums of the Sonnenschein summability matrices.
Balancing numbers possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of balancing numbers can be summed explicitly. For this, as a first step, a power $B_n^l$ is expressed as a linear combination of…
A new algorithm for calculating the stransverse mass, $M_{T2}$, in either symmetric or asymmetric situations has been developed which exhibits good stability, high precision and quadratic convergence for the majority of the $M_{T2}$…
A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…
A simple iteration methodology for the solution of a set of a linear algebraic equations is presented. The explanation of this method is based on a pure geometrical interpretation and pictorial representation. Convergence using this method…