Under sufficiently strong assumptions about the first prime in an arithmetic progression, we prove that the number of Carmichael numbers up to $X$ is $\gg X^{1-R}$, where $R=(2+o(1))\log \log \log \log X/\text{log}\log \log X$. This is close to Pomerance’s conjectured density of $X^{1-R}$ with $R=(1+o(1))\log \log \log X/\text{log}\log X$.

We prove that, given a positive integer $m$, there is a sequence $\{n_{i}\}_{i=1}^{k}$ of positive integers such that

$$\begin{eqnarray}m=\frac{1}{n_{1}}+\frac{1}{n_{2}}+\cdots +\frac{1}{n_{k}}\end{eqnarray}$$

$\{1/n_{i}\}_{i=1}^{k}$

Under sufficiently strong assumptions about the first term in an arithmetic progression, we prove that for any integer $a$, there are infinitely many $n\,\in \,\mathbb{N}$ such that for each prime factor $p\,\text{ }\!\!|\!\!\text{ }\,n$, we have $p\,-\,a\,\text{ }\!\!|\!\!\text{ }\,n\,-\,a$. This can be seen as a generalization of Carmichael numbers, which are integers $n$ such that $p\,-\,1\,\text{ }\!\!|\!\!\text{ }\,n\,-\,1$ for every $p\,\text{ }\!\!|\!\!\text{ }\,n$.

Assuming a conjecture intermediate in strength between one of Chowla and one of Heath-Brown on the least prime in a residue class, we show that for any coprime integers a and m≥1, there are infinitely many Carmichael numbers in the arithmetic progression a mod m.

Let $G\left( X \right)$ denote the number of positive composite integers $n$ satisfying $\sum\nolimits_{j=1}^{n-1}{{{j}^{n-1}}}\equiv -1\left( \,\bmod \,n \right)$. Then $G\left( X \right)\ll {{X}^{1/2}}\log \,X$ for sufficiently large $X$.

Constants with formulae of the form treated by D. Bailey, P. Borwein, and S. Plouffe ($b$ formulae to a given base $b$) have interesting computational properties, such as allowing single digits in their base $b$ expansion to be independently computed, and there are hints that they should be normal numbers, i.e., that their base $b$ digits are randomly distributed. We study a formally limited subset of BBP formulae, which we call Machin-type BBP formulae, for which it is relatively easy to determine whether or not a given constant $K$ has a Machin-type BBP formula. In particular, given $b\,\in \,\mathbb{N},\,b\,>\,2,\,b$ not a proper power, a $b$-ary Machin-type BBP arctangent formula for $K$ is a formula of the form $k\,=\,{{\Sigma }_{m}}\,{{a}_{m}}\,\arctan \,(-{{b}^{-m}}),\,{{a}_{m}}\,\in \,\mathbb{Q}$ , while when $b\,=\,2$, we also allow terms of the form ${{a}_{m}}\,\arctan \,(1/1\,-\,{{2}^{m}}))$ . Of particular interest, we show that $\pi$ has no Machin-type BBP arctangent formula when $b\,\ne \,2$. To the best of our knowledge, when there is no Machin-type BBP formula for a constant then no BBP formula of any form is known for that constant.