Related papers: A symmetry approach to number tricks
We consider numbers formed by concatenating some of the base b digits from additive functions f(n) that closely resemble the prime counting function \Omega(n). If we concatenate the last \lceil y \frac{\log \log \log n}{\log b} \rceil…
A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…
The grand unification scale $M_{GUT}\sim 10^{16}$ GeV may arise from dynamical effects. With the advances in understanding of supersymmetric dynamics, we can break the grand unified group by introducing a strong gauge group which generates…
For suitable subgroups of a finitely generated group, we define the intersection number of one subgroup with another subgroup and show that this number is symmetric. We also give an interpretation of this number.
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in general. In this paper we present an efficient solution for the homogeneous version of this problem; i.e. where the elements in each subset add…
The abc conjecture, one of the most famous open problems in number theory, claims that three positive integers satisfying a+b=c cannot simultaneously have significant repetition among their prime factors; in particular, the product of the…
We believe we have made progress in the age-old problem of divisibility rules for integers. Universal divisibility rule is introduced for any divisor in any base number system. The divisibility criterion is written down explicitly as a…
Sometimes it is possible to embed an algebraic trapdoor into a block cipher. Building on previous research, in this paper we investigate an especially dangerous algebraic structure, which is called a hidden sum and which is related to some…
We revisit a formula for the number of plane partitions due to Almkvist. Using the circle method, we provide modifications to his formula along with estimates of the errors. We show that the improved formula continues to be an asymptotic…
We call positive integer n a near-perfect number, if it is sum of all its proper divisors, except of one of them ("redundant divisor"). We prove an Euclid-like theorem for near-perfect numbers and obtain some other results for them.
In two recent articles we have examined a generalization of the binomial distribution associated with a sequence of positive numbers, involving asymmetric expressions of probabilities that break the symmetry {\it win-loss}. We present in…
Cryptographic systems are derived using units in group rings. Combinations of types of units in group rings give units not of any particular type. This includes cases of taking powers of units and products of such powers and adds the…
In this article, we present a trick around Fibonacci numbers which can be found in several magic books. It consists in computing quickly the sum of the successive terms of a Fibonacci-like sequence. We give explanations and extensions of…
Let $x$ be a real number satisfying $x \geq 2$. For any positive integer $n$, we define $s(n)$ as the smallest non-negative integer such that $n + s(n)$ is a perfect square. In this paper, we derive an asymptotic formula for the sum…
A positive integer n is said to be perfect if sigma(n)=2n, where sigma denotes the sum of the divisors of n. In this article, we show that if n is an even perfect number, then any integer m<=n is expressed as a sum of some of divisors of n.
Symmetry in integer programming causes redundant search and is often handled with symmetry breaking constraints that remove as many equivalent solutions as possible. We propose an algebraic method which allows to generate a random family of…
For certain sequences $A$ of positive integers with missing $g$-adic digits, the Dirichlet series $F_A(s) = \sum_{a\in A} a^{-s}$ has abscissa of convergence $\sigma_c < 1$. The number $\sigma_c$ is computed. This generalizes and…
In this paper, we extend recent results about the distribution of even and odd gaps of a numerical semigroup. We find that, for any numerical semigroup, the distribution can be computed in terms of the numbers of or the sums of odd and even…
Generalizing the concept of a perfect number, Sloane's sequences of integers A083207 lists the sequence of integers $n$ with the property: the positive factors of $n$ can be partitioned into two disjoint parts so that the sums of the two…
A numerical semigroup is called cyclotomic if its corresponding numerical semigroup polynomial $P_S(x)=(1-x)\sum_{s\in S}x^s$ is expressable as the product of cyclotomic polynomials. Ciolan, Garc\'ia-S\'anchez, and Moree conjectured that…