Related papers: Extending Sicherman Dice to 100-cell Calculation T…
To allow for Division By Zero, we develop a new algebraic structure containing addition and multiplication called an S-Extension of a Field. This unique structure extends a Field so that the equation $0\cdot s=x$ has exactly one solution…
Given a finite nonempty sequence S of integers, write it as XY^k, where Y^k is a power of greatest exponent that is a suffix of S: this k is the curling number of S. The Curling Number Conjecture is that if one starts with any initial…
If a cellular automaton (CA) is started with a single ON cell, how many cells will be ON after n generations? For certain "odd-rule" CAs, including Rule 150, Rule 614, and Fredkin's Replicator, the answer can be found by using the…
A C99 program is presented which calculates the Clausen sums for non-negative integer indices j and real arguments x. The implementation is split into three major cases. For large j, a direct, truncated summation of the sum is performed.…
Let $k_i\in \mathbb N$ $(i\ge 1)$ satisfy $2\le k_1\le k_2\le \ldots $. Freiman's theorem shows that when $j\in \mathbb N$, there exists $s=s(j)\in \mathbb N$ such that all large integers $n$ are represented in the form…
Let $p$ be a prime. In this short note we study some families of super congruences involving the following alternating sums \begin{equation*} \sum_{\substack{j_1+j_2+\cdots+j_n=2 p^r p\nmid j_1 j_2 \cdots j_n}}…
This paper expands and improves on the general Sieve method. This expaned and improved Sieve is applied to Goldbach's problem. A new estimate of the exception set in Goldbach's number E(X), an improved lower bound D_{1,2}(N) and upper bound…
This paper studies the number conservation property of 1-dimensional non-uniform cellular automata (CAs). In a non-uniform cellular automaton (CA), different cells may follow different rules. The present work considers that the cells follow…
For each $n\in N ^{\ast }$, we write $s_{n}=\left( 1,\ldots ,1,0\right) $ with $n$ times $1$. For each $a \in N$, we consider the binary representation $\left( a_{i}\right) _{i\in -N }$ of $a$ with $a_{i}=0$ for nearly each $i$; we denote…
In this paper we consider a Bayesian analysis of contingency tables allowing for the possibility that cells may have probability zero. In this sense we depart from standard log-linear modeling that implicitly assumes a positivity…
This letter shows that linear Cellular Automata based on rules 90/150 generate all the solutions of linear difference equations with binary constant coefficients. Some of these solutions are pseudo-random noise sequences with application in…
The problem of finding all the integer solutions in $a$, $M$ and $s$ of sums of $M$ consecutive integer squares starting at $a^{2}\geq1$ equal to squared integers $s^{2}$, has no solutions if $M\equiv3,5,6,7,8$ or $10\left(mod\,12\right)$…
In this work we develop exact formulas to the number of solutions of $ax+by+cz=n$ in some special cases. In 2020, Binner gave a formula for the number of non negative integer solutions, $N(a,b,c;n)$ in non-negative integer pairs $(x,y,z),$…
Although 10^230 terms of Recaman's sequence have been computed, it remains a mystery. Here three distant cousins of that sequence are described, one of which is also mysterious. (i) {A(n), n >= 3} is defined as follows. Start with n, and…
We report on experience with an investigation of the analytic structure of the solution of certain algebraic complex equations. In particular the behavior of their series expansions around the origin is discussed. The investigation imposes…
It was proved that whenever N is partitioned into finitely many cells, one cell must contain arbitrary length geo-arithmetic progressions. It was also proved that arithmetic and geometric progressions can be nicely intertwined in one cell…
Consider the congruence class R_m(a)={a+im:i\in Z} and the infinite arithmetic progression P_m(a)={a+im:i\in N_0}. For positive integers a,b,c,d,m the sum of products set R_m(a)R_m(b)+R_m(c)R_m(d) consists of all integers of the form…
Analytical expressions of the total number of $J$ levels for three and four fermions in a nuclear $j^n$ shell are provided. The formulas were derived using a combination of sum rules for coefficients of fractional parentage, and "unusual"…
We consider $N$, the number of solutions $(x,y,u,v)$ to the equation $ (-1)^u r a^x + (-1)^v s b^y = c $ in nonnegative integers $x, y$ and integers $u, v \in \{0,1\}$, for given integers $a>1$, $b>1$, $c>0$, $r>0$ and $s>0$. When…
Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…