Volume 6 ▶ Number 1 ▷ Number 2 ▷ Number 3 ▷ Number 4
Some remarks concerning the Bernoulli numbers
Original research paper. Pages 29–33
S. Tabirca
Full paper (PDF, 207 Kb) | Abstract
The aim of this article is to propose some remarks on the Bernoulli numbers. Firstly, a simple proof for the the equation
B2n+ 1 = 0 is presented. This proof also gives an equation for
ζ(2
k). Using a simple computation, the values of
ζ(2
k),
k = 1, 12 are presented. Finally, an equation for the infinite product
![Rendered by QuickLaTeX.com \prod_p \frac{p^{2k} - 1}{p^{2k} + 1}](https://nntdm.net/wp-content/ql-cache/quicklatex.com-2e0221b40733c961eb7d5ec31c278838_l3.png)
is proposed based on the Bernoulli numbers.
Some new equations concerning the Euler function
Original research paper. Pages 34–38
S. Tabirca and T. Tabirca
Full paper (PDF, 210 Kb) | Abstract
This article presents some new equations concerning the Euler function. An equation for the sum
![Rendered by QuickLaTeX.com \sum_{d|n} d^a \cdot \varphi^b(d)](https://nntdm.net/wp-content/ql-cache/quicklatex.com-a6c109c930e547b54b2dab3060e51f7f_l3.png)
is found by using the multiplicative property. This is applied to find the sums
![Rendered by QuickLaTeX.com \sum_{i=1}^n (i,n)^a](https://nntdm.net/wp-content/ql-cache/quicklatex.com-36ae3f36ac7ab36d8889065c2d884f66_l3.png)
and
![Rendered by QuickLaTeX.com \sum_{i=1}^n i \cdot (i,n)^a](https://nntdm.net/wp-content/ql-cache/quicklatex.com-9cfc78808b73fcf4e69793200999a16a_l3.png)
.
On prime k-tuples conjectures
Original research paper. Pages 39–44
V. Jotsov
Full paper (PDF, 193 Kb) | Abstract
There exist cases when experiments with the computational part of the research could lead to new theoretical proofs. New hypotheses are suggested in concern with the Hardy–Littlewood conjecture that there exist infinitely many prime k-tuples. Although all the details on the presented investigation are given in another scope papers (applied mathematical logic), the formulation of the presented hypotheses has an independent role. Strong relations are revealed with the investigations from Number Theory period before the Hardy and Littlewood down to the Greek system. The introduced formulas help to establish upper and lower bounds for different constellations of prime k-tuples.
On the one-sided orderability for semigroups
Original research paper. Pages 45–55
A. Baxhaku and M. Aslanski
Full paper (PDF, 358 Kb) | Abstract
In the papers of Merlier [5] and Saito [7] there are given some necessary and sufficient conditions on the linear orderability of the bands. Similar questions on semigroups are treated by Jordjev, Todorov [4] and Todorov [9]. In the last paper there are studied for the first time the one-sided orderable semigroups. We considerably enlarge the last studies, giving conditions under which a given semigroup should not be linearly orderable, (being perhaps left or right stable orderable) and conditions when a semigroup is not one sided orderable, or when it is no-one-sided orderable.
On the cardinal of the linear stable orders in a class of semigroups
Original research paper. Pages 56–60
A. Baxhaku and M. Aslanski
Full paper (PDF, 209 Kb) | Abstract
The main results are:
Theorem 1: For any semigroup
S generated by the non-idempotent elements
![Rendered by QuickLaTeX.com x_1, x_2, ..., x_n](https://nntdm.net/wp-content/ql-cache/quicklatex.com-e1793228c2254f92f006ba4d99f719d7_l3.png)
and the generating relations (i)
![Rendered by QuickLaTeX.com x_i x_j = x_j^2](https://nntdm.net/wp-content/ql-cache/quicklatex.com-91e8fe13dcc2ed4a20f3e4552db1e082_l3.png)
; (ii)
![Rendered by QuickLaTeX.com x_j^2 = x_j^3](https://nntdm.net/wp-content/ql-cache/quicklatex.com-b5eba3ad3806d8c921dc440e581d1716_l3.png)
and (3)
![Rendered by QuickLaTeX.com x_i^2 \neq x_j^2](https://nntdm.net/wp-content/ql-cache/quicklatex.com-9039579c3c04762846b52e28493acc3f_l3.png)
for
![Rendered by QuickLaTeX.com i \neq j](https://nntdm.net/wp-content/ql-cache/quicklatex.com-b65b6e97041b57c16836587c7b232f83_l3.png)
there exist
![Rendered by QuickLaTeX.com n!2^{n-1}](https://nntdm.net/wp-content/ql-cache/quicklatex.com-2eb3a8d9d10b025ef243da7a2ed3ab8a_l3.png)
non dual two-sided stable orders and
![Rendered by QuickLaTeX.com \frac{1}{2}[(2n)! - n!2n]](https://nntdm.net/wp-content/ql-cache/quicklatex.com-e2fcb4181c7c700c171e222f33112425_l3.png)
(non dual) one sided stable orders which are not two sided stable ones and
Theorem 2: Let
S’ be a semigroup generated by the idempotents
![Rendered by QuickLaTeX.com x_1, x_2, ..., x_k](https://nntdm.net/wp-content/ql-cache/quicklatex.com-06aead7f9ad2fd795f3578d021a55917_l3.png)
, the non-idempotents
![Rendered by QuickLaTeX.com x_{k+1}, x_{k+2}, ..., x_n](https://nntdm.net/wp-content/ql-cache/quicklatex.com-a2a4de9834ac7e8ea47f8e0060a5b9a7_l3.png)
and the relations (i),(ii),(iii). Then the semigroup
S’ has
![Rendered by QuickLaTeX.com n!2^{n-k-1}](https://nntdm.net/wp-content/ql-cache/quicklatex.com-65df9760721f49fbc5951dd94afacf9f_l3.png)
non-dual two-sided stable orders and
![Rendered by QuickLaTeX.com \frac{1}{2}[(2n - k)! -n!2^{n-k}]](https://nntdm.net/wp-content/ql-cache/quicklatex.com-273228146e3b706f521f6e9691280e96_l3.png)
only one-sided stable orders which are not two-sided stable ones.
Connections in mathematics: Fibonacci sequence via arithmetic progression
Original research paper. Pages 61–63
K. Atanassov
Full paper (PDF, 84 Kb)
On a formula related to the n-th partial sum of the harmonic series
Original research paper. Pages 64–68
M. Vassilev-Missana
Full paper (PDF, 139 Kb)
Volume 6 ▶ Number 1 ▷ Number 2 ▷ Number 3 ▷ Number 4