Related papers: A number system with base $-\frac32$
Problems in additive number theory related to sum and difference sets, more general binary linear forms, and representation functions of additive bases for the integers and nonnegative integers.
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32 to 128.
We propose a multi-scale analysis method for studying arithmetic properties of integer sets, such as primality. Our approach organizes information through a hierarchy of nested sequences, where each level enables a hierarchical expression…
In the present note we study the interrelations between the sets of so-called typical numbers and numbers that are normal in base two. Employing results by Nakai and Shiokawa, we exhibit examples of numbers that belong to one set but do not…
We consider positional numeration system with negative base, as introduced by Ito and Sadahiro. In particular, we focus on algebraic properties of negative bases $-\beta$ for which the corresponding dynamical system is sofic, which happens,…
Nature and our world have a bias! Roughly $30\%$ of the time the number $1$ occurs as the leading digit in many datasets base $10$. This phenomenon is known as Benford's law and it arrises in diverse fields such as the stock market,…
We study some essential arithmetic properties of a new tree-based number representation, {\em hereditarily binary numbers}, defined by applying recursively run-length encoding of bijective base-2 digits. Our representation expresses giant…
For each integer $b \geq 3$ and every $x \geq 1$, let $\mathcal{N}_{b,0}(x)$ be the set of positive integers $n \leq x$ which are divisible by the product of their nonzero base $b$ digits. We prove bounds of the form $x^{\rho_{b,0} + o(1)}…
A new number system, the set of the non-Dedekindian numbers, is introduced and characterized axiomatically. It is then proved that any hypercontinous hyperreal number system is strictly included in the set of the Non-Dedekindian Numbers.…
The cyclotomic matrix is commonly used to arrange cyclotomic numbers in a convenient format. A natural question is whether the structure of the matrix can reflect properties of these numbers. In this article, we examine cyclotomic numbers…
This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…
We first introduce the Hamming distance between two strings. Then, we apply this concept to the representations of whole numbers in base n for all positive integers n > 2. We claim that a simple formula exists for the sum of all Hamming…
Let F(x_1,...,x_m) = u_1 x_1 + ... + u_m x_m be a linear form with nonzero, relatively prime integer coefficients u_1,..., u_m. For any set A of integers, let F(A) = {F(a_1,...,a_m) : a_i in A for i=1,...,m}. The representation function…
A recently introduced numerical approach to quantum systems is analyzed. The basis of a Fock space is restricted and represented in an algebraic program. Convergence with increasing size of basis is proved and the difference between…
Throughout history, recreational mathematics has always played a prominent role in advancing research. Following in this tradition, in this paper we extend some recent work with crazy sequential representations of numbers- equations made of…
A Generalized Numeration Base is defined in this paper, and then particular cases are presented, such as Prime Base, Square Base, m-Power Base, Factorial Base, and operations in these bases. These bases are important for partitions of…
Given integers $a,b>1$ with $\log_b{a}$ irrational, we investigate the connection between the conjectured asymptotic equidistribution of digits in the base-$b$ expansion of $a^n$ and the (non-)Diophantine properties of the number…
Building of some isomorphic classes for noncanonical hypercomplex number systems o dimension 2 is described. In general case, such systems with specific constraints to structural constants can be isomorphic to complex, dual or double number…
We use bounds of character sums and some combinatorial arguments to show the abundance of very smooth numbers which also have very few non-zero binary digits.
In this work, we generalize the integer enumeration basis. We also construct bijections between the elements of special sets and the elements of some groups, and treat the special case of the hyperoctohedral groups. Then, we find a code…