CMS/SMC
Canadian Mathematical Society
www.cms.math.ca
Canadian Mathematical Society
  location:  Publicationsjournals
Publications        
Search results

Search: MSC category 11N25 ( Distribution of integers with specified multiplicative constraints )

  Expand all        Collapse all Results 1 - 7 of 7

1. CMB Online first

Pollack, Paul; Vandehey, Joseph
Some normal numbers generated by arithmetic functions
Let $g \geq 2$. A real number is said to be $g$-normal if its base $g$ expansion contains every finite sequence of digits with the expected limiting frequency. Let $\phi$ denote Euler's totient function, let $\sigma$ be the sum-of-divisors function, and let $\lambda$ be Carmichael's lambda-function. We show that if $f$ is any function formed by composing $\phi$, $\sigma$, or $\lambda$, then the number \[ 0. f(1) f(2) f(3) \dots \] obtained by concatenating the base $g$ digits of successive $f$-values is $g$-normal. We also prove the same result if the inputs $1, 2, 3, \dots$ are replaced with the primes $2, 3, 5, \dots$. The proof is an adaptation of a method introduced by Copeland and Erdős in 1946 to prove the $10$-normality of $0.235711131719\ldots$.

Keywords:normal number, Euler function, sum-of-divisors function, Carmichael lambda-function, Champernowne's number
Categories:11K16, 11A63, 11N25, 11N37

2. CMB Online first

Pollack, Paul; Vandehey, Joseph
Some normal numbers generated by arithmetic functions
Let $g \geq 2$. A real number is said to be $g$-normal if its base $g$ expansion contains every finite sequence of digits with the expected limiting frequency. Let $\phi$ denote Euler's totient function, let $\sigma$ be the sum-of-divisors function, and let $\lambda$ be Carmichael's lambda-function. We show that if $f$ is any function formed by composing $\phi$, $\sigma$, or $\lambda$, then the number \[ 0. f(1) f(2) f(3) \dots \] obtained by concatenating the base $g$ digits of successive $f$-values is $g$-normal. We also prove the same result if the inputs $1, 2, 3, \dots$ are replaced with the primes $2, 3, 5, \dots$. The proof is an adaptation of a method introduced by Copeland and Erdős in 1946 to prove the $10$-normality of $0.235711131719\ldots$.

Keywords:normal number, Euler function, sum-of-divisors function, Carmichael lambda-function, Champernowne's number
Categories:11K16, 11A63, 11N25, 11N37

3. CMB 2012 (vol 56 pp. 695)

Banks, William D.; Güloğlu, Ahmet M.; Yeager, Aaron M.
Carmichael meets Chebotarev
For any finite Galois extension $K$ of $\mathbb Q$ and any conjugacy class $C$ in $\operatorname {Gal}(K/\mathbb Q)$, we show that there exist infinitely many Carmichael numbers composed solely of primes for which the associated class of Frobenius automorphisms is $C$. This result implies that for every natural number $n$ there are infinitely many Carmichael numbers of the form $a^2+nb^2$ with $a,b\in\mathbb Z $.

Keywords:Carmichael numbers, Chebotarev density theorem
Categories:11N25, 11R45

4. CMB 2009 (vol 53 pp. 204)

5. CMB 2009 (vol 52 pp. 3)

Banks, W. D.
Carmichael Numbers with a Square Totient
Let $\varphi$ denote the Euler function. In this paper, we show that for all large $x$ there are more than $x^{0.33}$ Carmichael numbers $n\le x$ with the property that $\varphi(n)$ is a perfect square. We also obtain similar results for higher powers.

Categories:11N25, 11A25

6. CMB 2008 (vol 51 pp. 172)

Alkan, Emre; Zaharescu, Alexandru
Consecutive Large Gaps in Sequences Defined by Multiplicative Constraints
In this paper we obtain quantitative results on the occurrence of consecutive large gaps between $B$-free numbers, and consecutive large gaps between nonzero Fourier coefficients of a class of newforms without complex multiplication.

Keywords:$B$-free numbers, consecutive gaps
Categories:11N25, 11B05

7. CMB 1998 (vol 41 pp. 335)


© Canadian Mathematical Society, 2014 : https://cms.math.ca/