Related papers: On the average of triangular numbers
Scattered sequences are a generalization of scattered polynomials. So far, only scattered sequences of order one and two have been constructed. In this paper an infinite family of scattered sequences of order three is obtained. Equivalence…
We address a question and a conjecture on the expected length of the longest common subsequences of two i.i.d.$\ $random permutations of $[n]:=\{1,2,...,n\}$. The question is resolved by showing that the minimal expectation is not attained…
We count the number of subsets of $\{1,2,\cdots,n\}$ under different conditions and study the sequence obtained as we let $n$ increase.
We give a new proof of the $k$-fold convolution of the Catalan numbers. This is done by enumerating a certain class of polygonal dissections called $k$-in-$n$ dissections. Furthermore, we give a formula for the average number of cycles in a…
We consider the problem of the combinatorial computation of the first Chern class of a circle bundle. N.Mnev found such a formula in terms of canonical shellings. It represents certain invariant of a triangulation computed by analyzing…
A systematic study of the trigonometric equation A tan a + B sin b = C, where A, B and C^2 are rational numbers. The special case tan Pi/11 + 4 sin 3 Pi/11 = sqrt[11] appears in the classical literature.
We dedicate this paper to investigate the most generalized form of Fibonacci Sequence, one of the most studied sections of the mathematical literature. One can notice that, we have discussed even a more general form of the conventional one.…
We present a collection of results concerning the location and distribution of very triangular numbers among triangular numbers, including the twin very triangular number theorem, the existence of arbitrarily long gaps between -- and an…
A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Al- though censuses are useful resources for mathematicians, constructing them is difficult: the best…
Motivated by the study of the distribution of zeros of generalized Bessel-type functions, the principal goal of this paper is to identify new research directions in the theory of multiplier sequences. The investigations focus on multiplier…
We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…
The Brattelli diagram associated with a given bicolored Dynkin-Coxeter graph of type $A_n$ determines planar fractal sets obtained by infinite dissections of a given triangle. All triangles appearing in the dissection process have angles…
The conditions determining that two triangles are congruent play a basic role in planimetry. By comparing not congruent triangles with respect to given sets of corresponding elements it is important to discover if they have any common…
Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best linear approximates. Classical results from the theory of continued fractions provide the solution for the special homogeneous case in the…
Euler showed that there are infinitely many triangular numbers that are three times other triangular numbers. In general, it is an easy consequence of the Pell equation that for a given square-free m > 1, the relation P=mP' is satisfied by…
Sequences of Genocchi numbers of the first and second kind are considered. For these numbers, an approach based on their representation using sequences of polynomials is developed. Based on this approach, for these numbers some identities…
In this paper we study how to accelerate the convergence of the ratios (x_n) of generalized Fibonacci sequences. In particular, we provide recurrent formulas in order to generate subsequences (x_{g_n}) for every linear recurrent sequence…
On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…
We improve the estimates of the subgraph probabilities in a random regular graph. Using the improved results, we further improve the limiting distribution of the number of triangles in random regular graphs.
We prove that there are exactly five sequences, including the triangular numbers, that satisfy the product rule $T(mn) = T(m) T(n) + T(m-1) T(n-1)$ for all $m, n \ge 1$.