相关论文: On finding the smallest happy numbers of any heigh…

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…

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…

This paper extends the concept of a $B$-happy number, for $B \geq 2$, from the rational integers, $\mathbb{Z}$, to the Gaussian integers, $\mathbb{Z}[i]$. We investigate the fixed points and cycles of the Gaussian $B$-happy functions,…

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$…

A complex number $\alpha$ is said to satisfy the height reducing property if there is a finite set $F\subset \mathbb{Z}$ such that $\mathbb{Z}[\alpha]=F[\alpha]$, where $\mathbb{Z}$ is the ring of the rational integers. It is easy to see…

We use elementary methods to establish three key recurrence relations: one for derangement numbers, a second for harmonic numbers, and a third for degenerate harmonic numbers. Our results not only contribute to the understanding of the…

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…

Given a toric metrized R-divisor on a toric variety over a global field, we give a formula for the essential minimum of the associated height function. Under suitable positivity conditions, we also give formulae for all the successive…

Let $\alpha$ be a complex number. We show that there is a finite subset $F$ of the ring of the rational integers $\mathbb{Z}$, such that $F\left[ \alpha\right] =\mathbb{Z}\left[ \alpha\right]$, if and only if $\alpha$ is an algebraic number…

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…

The height of an algebraic number $\alpha$ is a measure of how arithmetically complicated $\alpha$ is. We say $\alpha$ is totally $p$-adic if the minimal polynomial of $\alpha$ splits completely over the field $\mathbb{Q}_p$ of $p$-adic…

A complex number alpha is said to satisfy the height reducing property if there is a finite subset F of the ring Z of the rational integers such that Z[alpha]=F[alpha]. This problem of finding F has been considered by several authors,…

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…

Given a list of N numbers, the maximum can be computed in N iterations. During these N iterations, the maximum gets updated on average as many times as the Nth harmonic number. We first use this fact to approximate the Nth harmonic number…

We construct an algorithm for solving the following problem: given a number field $K$, a positive integer $N$, and a positive real number $B$, determine all points in $\mathbb P^N(K)$ having relative height at most $B$. A theoretical…

The height $H(n)$ of $n$, introduced by Pillai in 1929, is the smallest positive integer $i$ such that the $i$th iterate of Euler's totient function at $n$ is $1$. H. N. Shapiro (1943) studied the structure of the set of all numbers at a…

For any class of one-sided $1-\alpha$ confidence intervals with a certain monotonicity ordering on the random confidence limit, the smallest interval, in the sense of the set inclusion for the difference of two proportions of two…

Suppose we have n keys, n access probabilities for the keys, and n+1 access probabilities for the gaps between the keys. Let h_min(n) be the minimal height of a binary search tree for n keys. We consider the problem to construct an optimal…

Given a set $S$ of $n$ keys, a perfect hash function for $S$ maps the keys in $S$ to the first $m \geq n$ integers without collisions. It may return an arbitrary result for any key not in $S$ and is called minimal if $m = n$. The most…

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…