Related papers: A result similar to Lagrange's theorem

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

Let $p$ be a prime. We define $S(p)$ the smallest number $k$ such that every positive integer is a sum of at most $k$ squares of integers that are not divisible by $p$. In this article, we prove that $S(2)=10$, $S(3)=6$, $S(5)=5$, and…

We prove that every positive integer $n$ which is not equal to $1$, $2$, $3$, $6$, $11$, $30$, $155$, or $247$ can be represented as a sum of a squarefree number and a prime not exceeding $\sqrt{n}$.

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally…

Zeckendorf's theorem states that every positive integer can be uniquely decomposed as a sum of nonconsecutive Fibonacci numbers, where the Fibonacci numbers satisfy $F_n=F_{n-1}+F_{n-2}$ for $n\geq 3$, $F_1=1$ and $F_2=2$. The distribution…

By extending a construction due to Gross and McMullen [2], we show that for any odd integer n and for any even integer d>n+2 there are infinitely many Salem numbers $\alpha$ of degree d such that $\alpha^n-1$ is a unit. A similar result is…

We show that the octonions can be defined as the $\mathbb{R}$-algebra with basis $\lbrace e^x \colon x \in \mathbb{F}_8 \rbrace$ and multiplication given by $e^x e^y = (-1)^{\varphi(x,y)}e^{x + y}$, where $\varphi(x,y) = \operatorname{tr}(y…

We prove that any centered $1$-subgaussian random vector in $\mathbb{R}^{n}$ can be written as the sum of a universal number of standard Gaussian vectors. Following the work of the second-named author, this solves M. Talagrand's convexity…

We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…

We prove that every integer $n \geq 10$ such that $n \not\equiv 1 \text{mod} 4$ can be written as the sum of the square of a prime and a square-free number. This makes explicit a theorem of Erd\H{o}s that every sufficiently large integer of…

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

We show that every $N \geq 2$ can be written as the sum of positive integers $a$ and $b$ where $\Omega(ab) \leq 40$. The result is obtained through the direct application of an explicit lower bound Selberg sieve along with some computation…

Let $p$ be a prime integer and $\mathbb{Z}_p$ be the ring of $p$-adic integers. By a purely computational approach we prove that each nonzero normal element of a completed group algebra over the special linear group ${\rm…

Let $a,b,c$ be positive integers. It is known that there are infinitely many positive integers not representated by $ax^2+by^2+cz^2$ with $x,y,z\in\mathbb Z$. In contrast, we conjecture that any natural number is represented by $\lfloor…

Zeckendorf's theorem states that every positive integer can be uniquely decomposed as a sum of nonconsecutive Fibonacci numbers. The distribution of the number of summands converges to a Gaussian, and the individual measures on gaps between…

A single parameter cubic composite test for odd positive integers is given which relies on the discriminant always being a square integer. This test has no known counterexample despite extensive verifications. As well as a comparison with…

In this paper, we partially solve an open problem, due to J.C. Molluzzo in 1976, on the existence of balanced Steinhaus triangles modulo a positive integer $n$, that are Steinhaus triangles containing all the elements of…

We show that every sum of squares in the three-variable Laurent series field $\mathbb{R}((x,y,z))$ is a sum of 4 squares, as was conjectured in a paper of Choi, Dai, Lam and Reznick in the 1980's. We obtain this result by proving that every…

For positive integers $a,b,c$, and an integer $n$, the number of integer solutions $(x,y,z) \in \mathbb Z^3$ of $a \frac{x(x-1)}{2} + b \frac{y(y-1)}{2} + c \frac{z(z-1)}{2} = n$ is denoted by $t(a,b,c;n)$. In this article, we prove some…

Let a and b be positive integers with a \leq b. An (a,b)-triple is a set {x,ax+d,bx+ 2d}, where x,d \geq 1. Define T(a,b;r) to be the least positive integer n such that any r-coloring of {1,2...,n} contains a monochromatic (a,b)-triple.…