For an integer $k\ge 2$, let ${\left(n\right)}_n$ be the $k-$generalized Pell sequence which starts with $0,...,0,1$ ($k$ terms) and each term afterwards is given by the linear recurrence $n=2n-1+n-2+\cdots +n-k$. In this paper, we find all $k$-generalized Pell numbers with only one distinct digit (the so-called repdigits). Some interesting estimations involving generalized Pell numbers, that we believe are of independent interest, are also deduced. This paper continues a previous work that searched for repdigits in the usual Pell sequence ${\left(P_n^{\left(2\right)}\right)}_n$.

The sequence of balancing numbers $\left(B_n\right)$ is defined by the recurrence relation $B_n=6B_{n-1}-B_{n-2}$ for $n\ge 2$ with initial conditions $B_0=0$ and $B_1=1.$$B_n$ is called the $n$th balancing number. In this paper, we find all repdigits in the base $b,$ which are sums of four balancing numbers. As a result of our theorem,...

$s\left(n\right)$ désigne la somme des chiffres de l’entier $n$ en base $q$ et ${\sigma }_{\alpha }\left(n\right)$ la somme des chiffres de $n$ associée au développement de $\alpha$ en fraction continue. Dans un article paru aux Annales de l’Institut Fourier (31 (1981), 1–15), Coquet, Rhin et Toffin montrent que, lorsque $x$ ou $y$ est irrationnel, la suite $xs+y{\sigma }_{\alpha }$ est équirépartie modulo 1. On précise ici que l’équirépartition est uniforme.

A representation field for a non-maximal order $ℌ$ in a central simple algebra is a subfield of the spinor class field of maximal orders which determines the set of spinor genera of maximal orders containing a copy of $ℌ$. Not every non-maximal order has a representation field. In this work we prove that every commutative order has a representation field and give a formula for it. The main result is proved for central simple algebras over arbitrary global fields.

Let $\mathbb{Z}$ be the set of integers, ${\mathbb{N}}_0$ the set of nonnegative integers and $F(x_1,x_2)=u_1{x}_1+u_2{x}_2$ be a binary linear form whose coefficients $u_1$, $u_2$ are nonzero, relatively prime integers such that $u_1{u}_2\ne \pm 1$ and $u_1{u}_2\ne -2$. Let $f:\mathbb{Z}\to {\mathbb{N}}_0\cup \left\{\infty \right\}$ be any function such that the set $f^{-1}\left(0\right)$ has asymptotic density zero. In 2007, M. B. Nathanson (2007) proved that there exists a set $A$ of integers such that $r_{A,F}\left(n\right)=f\left(n\right)$ for all integers $n$, where $r_{A,F}\left(n\right)=\left|\{(a,a^{\text{'}}):n=u_{1}a+u_2{a}^{\text{'}}:a,a^{\text{'}}\in A\}\right|$. We add the structure of difference for the binary linear form $F(x_1,x_2)$.

For any given positive integer k, and any set A of nonnegative integers, let $r_{1,k}(A,n)$ denote the number of solutions of the equation n = a₁ + ka₂ with a₁,a₂ ∈ A. We prove that if k,l are multiplicatively independent integers, i.e., log k/log l is irrational, then there does not exist any set A ⊆ ℕ such that both $r_{1,k}(A,n)=r_{1,k}(\mathbb{N}\setminus A,n)$ and $r_{1,l}(A,n)=r_{1,l}(\mathbb{N}\setminus A,n)$ hold for all n ≥ n₀. We also pose a conjecture and two problems for further research.