相关论文: Convergence and Divergence of Mersenne Variations …

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The…

Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least…

The three gap theorem was originally a conjecture by Steinhaus, who asserted that there are at most three distinct gap lengths in the fractional parts of the sequence {\alpha},{2}{\alpha},{\cdots},{N}{\alpha} for any integer {N} and real…

A version of the so-called "convexification" numerical method for a coefficient inverse scattering problem for the 3D Hemholtz equation is developed analytically and tested numerically. Backscattering data are used, which result from a…

We propose developing the theory of consequences of morasses relevant in mathematical applications in the language alternative to the usual one, replacing commonly used structures by families of sets originating with Velleman's neat…

Statistical convergence was introduced in connection with problems of series summation. The main idea of the statistical convergence of a sequence l is that the majority of elements from l converge and we do not care what is going on with…

We present a comprehensive structural analysis of the Collatz conjecture through ~1014 computational experiments yielding 630 formal results. By systematically deploying 29 distinct mathematical paradigms--including transfer operator…

Logical theories have been developed which have allowed temporal reasoning about eventualities (a la Galton) such as states, processes, actions, events, processes and complex eventualities such as sequences and recurrences of other…

The aim of this paper is to show a peculiar behavior of a (hypothetical) Collatz sequence going to infinity. We study the associated Syracusa sequence (the odd elements of the former) and show that the limit set of a conveniently normalized…

An operational approach to the Collatz Conjecture is presented. Scenarios are defined as strings of characters "s" (for "spike") and "d" (for "down") which symbolize the Collatz operations (3m+1)/2 and m/2 in a Collatz Series connecting two…

We develop a general form of the Ritz method for trial functions that do not satisfy the essential boundary conditions. The idea is to treat the latter as variational constraints and remove them using the Lagrange multipliers. In…

In this paper, we trace the development of the theory of the calculus of variations. From its roots in the work of Greek thinkers and continuing through to the Renaissance, we see that advances in physics serve as a catalyst for…

The nonlinear recurrences we consider here include the functions $3x(1-x)$ and $\cos(x)$, which possess attractive fixed points $2/3$ and $0.739...$ (Dottie's number). Detailed asymptotics for oscillatory convergence are found, starting…

In a space of 4-dimensions, I will examine constrained variational problems in which the Lagrangian, and constraint scalar density, are concomitants of a (pseudo-Riemannian) metric tensor and its first two derivatives. The Lagrange…

Using $p$-adic numbers, we partially categorize the cycles of a sizable class of polynomial dynamical systems. In turn, we prove a few results related to the non-trivial cycles of the $\textit{Collatz map}$ $\text{Col} : \mathbb{Z}_+ \to…

Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…

Thanks to the interest of many people, a mistake has been found in our way of counting limit cycles. We are working on a new version.

Professor Cadogan at the University of the West Indies identified special starting points that yield long subsequences where the normalization constant, k, is always one. I studied these special sequences and found an implicit mixed integer…

The 3x+1 semigroup is the multiplicative semigroup generated by the rational numbers of form (2k+1)/(3k+2) for non-negative k, together with 2. This semigroup encodes backward iteration under the 3x+1 map, and the 3x+1 conjecture implies…

We consider a variety of Euler's conjecture, i.e., whether the Diophantine system \[\begin{cases} n=a_{1}+a_{2}+\cdots+a_{s-1}, a_{1}a_{2}\cdots a_{s-1}(a_{1}+a_{2}+\cdots+a_{s-1})=b^{s} \end{cases}\] has solutions…