Related papers: Elementary closed-forms for non-trivial divisors

In this paper we review the properties of families of numbers of the form $6n\pm1$, with $n$ integer (in which there are all prime numbers greater than 3 and other compound numbers with particular properties) to later use them in a new…

This paper considers computational methods that split a vector field into three components in the case when both the vector field and the split components might be unbounded. We first employ classical Taylor expansion which, after some…

Let $\tau(n)$ denote the classical divisor function. In this paper, we consider the hyperbolic fractional sum of the divisor function defined by $$ T(x) = \sum_{n_1 n_2 \leqslant x} \tau\left( \left[ \frac{x}{n_1 n_2} \right] \right) =…

Circular and non-wellfounded proofs have become an increasingly popular tool for metalogical treatments of systems with forms of induction and/or recursion. In this work we investigate the expressivity of a variant CT of G\"odel's system T…

Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq…

The main result of this thesis is to show that there are only finitely many integers $n$ such that both $n$ and $d(n)$ are highly composite numbers at the same time, where $d(n)$ is the divisor function. Bertrand's postulate [4] is used…

In this paper, to solve the invariant subspace problem, contraction operators are classified into three classes ; (Case 1) completely non-unitary contractions with a non-trivial algebraic element, (Case 2) completely non-unitary…

This paper presents an exact and explicit tensor-network equation for the search of nontrivial divisors of a composite integer, together with an algorithm for its computation. The proposed method is based on the MeLoCoToN approach, which…

In this paper, we derive simple closed-form expressions for the $n$-queens problem and three related problems in terms of permanents of $(0,1)$ matrices. These formulas are the first of their kind. Moreover, they provide the first method…

We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the…

This paper presents a primitive $n$th root of unity in $\mathbb C$. The approach is very elementary and avoids the following: the complex exponential function, trigonometry, and group theory. It also avoids differentiation, integration, and…

The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…

We consider Hamiltonian PDEs that can be split into a linear unbounded operator and a regular non linear part. We consider abstract splitting methods associated with this decomposition where no discretization in space is made. We prove a…

The division operation is important for many areas of data processing. Especially considering today's demand for hardware accelerators for machine learning algorithms, there is a high demand for an efficient calculation of the division…

Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…

We prove the existence of a non-trivial hyperinvariant subspace for several sets of polynomially compact operators. The main results of the paper are: (i) a non-trivial norm closed algebra $\mathcal A\subseteq \mathcal B(\mathscr X)$ which…

In this work, we extend the fractional linear multistep methods in [C. Lubich, SIAM J. Math. Anal., 17 (1986), pp.704--719] to the tempered fractional integral and derivative operators in the sense that the tempered fractional derivative…

A unified explicit form for difference formulas to approximate the fractional and classical derivatives is presented. The formula gives finite difference approximations for any classical derivatives with a desired order of accuracy at nodal…

Let X be a tight t-design of dimension n for one of the open cases t=5 or t=7. An investigation of the lattice generated by X using arithmetic theory of quadratic forms allows to exclude infinitely many values for n.

Several applications of slicing require a program to be sliced with respect to more than one slicing criterion. Program specialization, parallelization and cohesion measurement are examples of such applications. These applications can…