Table of Contents
Fetching ...

On primary Carmichael numbers

Bernd C. Kellner

Abstract

The primary Carmichael numbers were recently introduced as a special subset of the Carmichael numbers. A primary Carmichael number $m$ has the unique property that $s_p(m) = p$ holds for each prime factor $p$, where $s_p(m)$ is the sum of the base-$p$ digits of $m$. The first such number is Ramanujan's famous taxicab number $1729$. Due to Chernick, all Carmichael numbers with three factors can be constructed by certain squarefree polynomials $U_3(t) \in \mathbb{Z}[t]$, the simplest one being $U_3(t) = (6t+1)(12t+1)(18t+1)$. We show that the values of any $U_3(t)$ obey a special decomposition for all $t \geq 2$ and besides certain exceptions also in the case $t=1$. These cases further imply that if all three factors of $U_3(t)$ are simultaneously odd primes, then $U_3(t)$ is not only a Carmichael number, but also a primary Carmichael number. Together with the exceptional cases, all Carmichael numbers with three factors have at least the property that $s_p(m) = p$ holds for the greatest prime factor $p$ of $m$. Subsequently, we show some connections to taxicab and polygonal numbers, involving the number $1729$ as an example again.

On primary Carmichael numbers

Abstract

The primary Carmichael numbers were recently introduced as a special subset of the Carmichael numbers. A primary Carmichael number has the unique property that holds for each prime factor , where is the sum of the base- digits of . The first such number is Ramanujan's famous taxicab number . Due to Chernick, all Carmichael numbers with three factors can be constructed by certain squarefree polynomials , the simplest one being . We show that the values of any obey a special decomposition for all and besides certain exceptions also in the case . These cases further imply that if all three factors of are simultaneously odd primes, then is not only a Carmichael number, but also a primary Carmichael number. Together with the exceptional cases, all Carmichael numbers with three factors have at least the property that holds for the greatest prime factor of . Subsequently, we show some connections to taxicab and polygonal numbers, involving the number as an example again.

Paper Structure

This paper contains 10 sections, 29 theorems, 208 equations, 12 tables.

Key Result

Theorem \oldthetheorem

A positive composite integer $m$ is a Carmichael number if and only if $m$ is squarefree and

Theorems & Definitions (59)

  • Theorem \oldthetheorem: Korselt's criterion Korselt:1899 (1899)
  • Theorem \oldthetheorem: Carmichael Carmichael:1910Carmichael:1912 (1910,1912)
  • Theorem \oldthetheorem: Kellner and Sondow KellnerSondow:2021
  • Theorem \oldthetheorem: Kellner and Sondow KellnerSondow:2021
  • Theorem \oldthetheorem
  • Theorem \oldthetheorem
  • Theorem \oldthetheorem
  • Theorem \oldthetheorem
  • Remark
  • Theorem \oldthetheorem
  • ...and 49 more