Related papers: A Study of @-numbers
We continue the investigation, that began in [3] and [4], into finite groups whose set of nontrivial conjugacy class sizes form an arithmetic progression. Let $G$ be a finite group and denote the set of conjugacy class sizes of $G$ by ${\rm…
Let $P(x):=a_d x^d+\cdots+a_0\in\mathbb{Q}[x]$, $a_d>0$, be a polynomial of degree $d\geq 2$. Let $(x_n)$ be a sequence of integers satisfying \begin{equation*} x_{n+1}=P(x_n)\mbox{for all}\quad n=0,1,2\ldots,\quad\mbox{and} \quad…
Many statistical models are algebraic in that they are defined in terms of polynomial constraints, or in terms of polynomial or rational parametrizations. The parameter spaces of such models are typically semi-algebraic subsets of the…
Linear harmonic number sums had been studied by a variety of authors during the last centuries, but only few results are known about nonlinear Euler sums of quadratic or even higher degree. The first systematic study on nonlinear Euler sums…
It is known that the M\"obius function in number theory is higher order oscillating. In this paper we show that there is another kind of higher order oscillating sequences in the form $(e^{2\pi i \alpha \beta^{n}g(\beta)})_{n\in \N}$, for a…
Shor's factoring algorithm (SFA) finds the prime factors of a number, $N=p_1 p_2$, exponentially faster than the best known classical algorithm. Responsible for the speed-up is a subroutine called the quantum order finding algorithm (QOFA)…
We prove that if $\alpha$ is a non-zero algebraic number of degree $d \geq 2$ which is not a root of unity, then $dh(\alpha)>(1/4) (\log(\log (d))/\log(d))^3.
Let $G$ be a finite group and $\sigma$ a partition of the set of all? primes $\Bbb{P}$, that is, $\sigma =\{\sigma_i \mid i\in I \}$, where $\Bbb{P}=\bigcup_{i\in I} \sigma_i$ and $\sigma_i\cap \sigma_j= \emptyset $ for all $i\ne j$. If $n$…
About fifty years ago Mahler proved that if $\alpha>1$ is rational but not an integer and if $0<l<1$ then the fractional part of $\alpha^n$ is $>l^n$ apart from a finite set of integers $n$ depending on $\alpha$ and $l$. Answering…
We study some divisibility properties of multiperfect numbers. Our main result is: if $N=p_1^{\alpha_1}... p_s^{\alpha_s} q_1^{2\beta_1}... q_t^{2\beta_t}$ with $\beta_1, ..., \beta_t$ in some finite set S satisfies…
Literature considers under the name \emph{unimaginable numbers} any positive integer going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathematical…
Let $X_1, X_2,\ldots, X_n$ (resp. $Y_1, Y_2,\ldots, Y_n$) be independent random variables such that $X_i$ (resp. $Y_i$) follows generalized exponential distribution with shape parameter $\theta_i$ and scale parameter $\lambda_i$ (resp.…
Using the theory of noncommutative symmetric functions, we introduce the higher order peak algebras, a sequence of graded Hopf algebras which contain the descent algebra and the usual peak algebra as initial cases (N = 1 and N = 2). We…
Euler function $\phi(n)$ is the number of positive integers less than $n$ and relatively prime to $n$. Suppose that $\phi^1(n)=\phi(n)$ and $\phi^i(n)=\phi(\phi^{i-1}(n))$. Let $A\subseteq \mathbb{N}$, and $A_{\phi}=\{ \phi^k(n)| n\in A ,…
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,…
Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…
Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…
The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…
Write $T(n)$ as the sum of the reciprocals of the primes which divide $n$. Write $H(n) = \prod_{p|n}p/(p-1)$ where the product is over the prime divisors of $n$. We prove new bounds for $T(n)$ and $H(n)$ in terms of the smallest prime…
A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…