Related papers: Gaussian Happy Numbers

A generalized happy function, $S_{e,b}$ maps a positive integer to the sum of its base $b$ digits raised to the $e^\text{th}$ power. We say that $x$ is a base $b$, $e$ power, height $h$, $u$ attracted number if $h$ is the smallest positive…

An augmented generalized happy function $S_{[c,b]}$ maps a positive integer to the sum of the squares of its base $b$ digits plus $c$. In this paper, we study various properties of the fixed points of $S_{[c,b]}$; count the number of fixed…

For a base $b \geq 2$, the $b$-elated function, $E_{2,b}$, maps a positive integer written in base $b$ to the product of its leading digit and the sum of the squares of its digits. A $b$-elated number is a positive integer that maps to $1$…

This paper focuses on finding the smallest happy number for each height in any numerical base. Using the properties of the height, we deduce a recursive relationship between the smallest happy number and the height where the initial height…

For $b\leq -2$ and $e \geq 2$, let $S_{e,b}:\mathbb{Z}\to\mathbb{Z}_{\geq 0}$ be the function taking an integer to the sum of the $e$-powers of the digits of its base $b$ expansion. An integer $a$ is a $b$-happy number if there exists…

Let e>=1 and b>=2 be integers. For a positive integer n=\sum_{j=0}^ka_jb^j with 0<=a_j<b, define T_{e,b}(n)=\sum_{j=0}^ka_j^e. n is called (e,b)-happy if T_{e,b}^r(n)=1 for some r>=0, where T_{e,b}^r is the r-th iteration of T_{e,b}. In…

In this article, we present a method to construct $e$-power $b$-happy numbers of any height. Using this method, we construct a tree that encodes these happy numbers, their heights, and their ancestry--relation to other happy numbers. For…

An augmented generalized happy function $S_{[c,b]}$ maps a positive integer to the sum of the squares of its base $b$ digits plus $c$. For $b\geq 2$ and $k \in \mathbb{Z}^+$, a $k$-desert base $b$ is a set of $k$ consecutive non-negative…

The happy function $H: \mathbb{N} \rightarrow \mathbb{N}$ sends a positive integer to the sum of the squares of its digits. A number $x$ is said to be happy if the sequence $\{H^n(x)\}^\infty_{n=1}$ eventually reaches one. A basic open…

An augmented happy function, $S_{[c,b]}$ maps a positive integer to the sum of the squares of its base-$b$ digits and a non-negative integer $c$. A positive integer $u$ is in a cycle of $S_{[c,b]}$ if, for some positive integer $k$,…

In the classical sense, the set B consists of all integers which can be written as a sum of two perfect squares. In other words, these are the values attained by norms of integral ideals over the Gaussian field Q(i). G.J. Rieger (1965) and…

Building upon previous works of Andr{\'e} and Chudnovsky, we prove a general result concerning the approximations of values at rational points a/b of any G-function F with rational Taylor coefficients by fractions of the form n/(B…

This paper investigates a variant of the famous "happy numbers" sequence, given by A351327 on the oeis. First of all we'll define this integer sequence, and then we'll show some important results about it; in particular we conjectured that…

When $A$ and $B$ are subsets of the integers in $[1,X]$ and $[1,Y]$ respectively, with $|A| \geq \alpha X$ and $|B| \geq \beta X$, we show that the number of rational numbers expressible as $a/b$ with $(a,b)$ in $A \times B$ is $\gg (\alpha…

We show the 3 by 3 magic square of squares problem equivalent to solving quartic polynomials with certain factorization constraints over an abelian extension of the rationals. We analyze a particular case in which said extension is assumed…

In this paper, we consider a classic problem concerning the high excursion probabilities of a Gaussian random field $f$ living on a compact set $T$. We develop efficient computational methods for the tail probabilities $P(\sup_T f(t) > b)$…

We show that there exists some $\delta > 0$ such that, for any set of integers $B$ with $B\cap[1,Y]\gg Y^{1-\delta}$ for all $Y \gg 1$, there are infinitely many primes of the form $a^2+b^2$ with $b\in B$. We prove a quasi-explicit formula…

We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…

We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer…

We consider linear statistics of the scaled zeros of Dirichlet $L$--functions, and show that the first few moments converge to the Gaussian moments. The number of Gaussian moments depends on the particular statistic considered. The same…