• Thumbnail for Carmichael function
    In number theory, a branch of mathematics, the Carmichael function λ(n) of a positive integer n is the smallest positive integer m such that a m ≡ 1 (...
    22 KB (3,131 words) - 07:03, 5 November 2024
  • Thumbnail for Euler's totient function
    the product of the first 120569 primes. Carmichael function (λ) Dedekind psi function (𝜓) Divisor function (σ) Duffin–Schaeffer conjecture Generalizations...
    44 KB (6,473 words) - 13:18, 17 October 2024
  • functions Liouville function, λ(n) = (–1)Ω(n) Von Mangoldt function, Λ(n) = log p if n is a positive power of the prime p Carmichael function Logarithmic integral...
    10 KB (1,065 words) - 20:52, 29 October 2024
  • Thumbnail for Carmichael number
    In number theory, a Carmichael number is a composite number ⁠ n {\displaystyle n} ⁠ which in modular arithmetic satisfies the congruence relation: b n...
    28 KB (3,570 words) - 06:36, 4 November 2024
  • In mathematics, Carmichael's totient function conjecture concerns the multiplicity of values of Euler's totient function φ(n), which counts the number...
    8 KB (839 words) - 17:54, 27 March 2024
  • a_{k}\;\land \;n=a_{1}+a_{2}+\cdots +a_{k}\right\}\right|.} λ(n), the Carmichael function, is the smallest positive number such that a λ ( n ) ≡ 1 ( mod n...
    53 KB (7,510 words) - 15:12, 9 November 2024
  • Thumbnail for Robert Daniel Carmichael
    although they are not primes), Carmichael's totient function conjecture, Carmichael's theorem, and the Carmichael function, all significant in number theory...
    7 KB (691 words) - 20:15, 3 November 2024
  • function, λ(τ), a highly symmetric holomorphic function on the complex upper half-plane Carmichael function, λ(n), in number theory and group theory Lambda...
    956 bytes (152 words) - 22:28, 17 August 2024
  • Thumbnail for Stokely Carmichael
    Kwame Ture (/ˈkwɑːmeɪ ˈtʊəreɪ/; born Stokely Standiford Churchill Carmichael; June 29, 1941 – November 15, 1998) was an American activist who played a...
    84 KB (10,130 words) - 09:54, 18 November 2024
  • and q of n. Fermat's little theorem is also related to the Carmichael function and Carmichael's theorem, as well as to Lagrange's theorem in group theory...
    18 KB (2,368 words) - 19:19, 20 August 2024
  • }}(M)}\right){\bmod {M}}} , where λ {\displaystyle \lambda } is the Carmichael function. (Here we have λ ( M ) = λ ( p ⋅ q ) = lcm ⁡ ( p − 1 , q − 1 ) {\displaystyle...
    9 KB (1,213 words) - 04:58, 22 May 2024
  • factor of λ(49) = 42, where λ(n) is known as the Carmichael function. This follows from Carmichael's theorem which states that if n is a positive integer...
    56 KB (7,291 words) - 23:11, 20 November 2024
  • generates it. The order of a (mod n) also divides λ(n), a value of the Carmichael function, which is an even stronger statement than the divisibility of φ(n)...
    5 KB (624 words) - 01:54, 24 August 2024
  • density ecliptic longitude in astronomy the Liouville function in number theory the Carmichael function in number theory the empty string in formal grammar...
    37 KB (3,441 words) - 10:36, 19 November 2024
  • no primitive roots modulo 15. Indeed, λ(15) = 4, where λ is the Carmichael function. (sequence A002322 in the OEIS) Numbers n {\displaystyle n} that...
    22 KB (2,508 words) - 06:53, 5 November 2024
  • {\displaystyle \phi (x)=k} , where ϕ {\displaystyle \phi } is Euler's totient function, than any integer smaller than it. The first few highly totient numbers...
    3 KB (370 words) - 12:16, 27 March 2024
  • {\displaystyle k} and above 1. Here, ϕ {\displaystyle \phi } is Euler's totient function. There are infinitely many solutions to the equation for k {\displaystyle...
    4 KB (383 words) - 06:30, 1 April 2024
  • Thumbnail for Key encapsulation mechanism
    \lambda (n))=1} , where λ ( n ) {\displaystyle \lambda (n)} is the Carmichael function. Compute d := e − 1 mod λ ( n ) {\displaystyle d:=e^{-1}{\bmod {\lambda...
    25 KB (3,047 words) - 06:13, 21 September 2024
  • ≡ 1 (mod λ(N)), where λ(N) denotes the Carmichael function, though sometimes φ(N), the Euler's totient function, is used (note: this is the order of the...
    12 KB (1,759 words) - 16:06, 11 November 2024
  • Thumbnail for Multiplicative group of integers modulo n
    common multiple of the orders in the cyclic groups, is given by the Carmichael function λ ( n ) {\displaystyle \lambda (n)} (sequence A002322 in the OEIS)...
    26 KB (3,163 words) - 12:13, 7 October 2024
  • because p is prime. Therefore, unless q divides b − 1, p divides the Carmichael function of q, which is even and equal to q − 1. Any positive multiple of...
    27 KB (3,414 words) - 15:25, 21 October 2024
  • and φ {\displaystyle \varphi } are respectively the Carmichael function and Euler's totient function. A root of unity modulo n is a primitive kth root of...
    11 KB (2,091 words) - 09:56, 26 February 2024
  • one way. 224 is the smallest k with λ(k) = 24, where λ(k) is the Carmichael function. The mathematician and philosopher Alex Bellos suggested in 2014...
    3 KB (472 words) - 17:25, 27 August 2024
  • 0, 0, 8, 0, 2, 0, 0, 0, 2, 0, 17, ... (sequence A014197 in the OEIS) Carmichael's conjecture is that there are no 1s in this sequence. An even nontotient...
    7 KB (663 words) - 17:43, 20 May 2024
  • Jordan's totient function, denoted as J k ( n ) {\displaystyle J_{k}(n)} , where k {\displaystyle k} is a positive integer, is a function of a positive integer...
    6 KB (921 words) - 23:18, 29 March 2024
  • integers below it. That is, m − φ(m) = n, where φ stands for Euler's totient function, has no solution for m. The cototient of n is defined as n − φ(n), so a...
    9 KB (808 words) - 00:03, 2 May 2024
  • Thumbnail for Exponentiation
    function xy has no limit at the point (0, 0). One may consider at what points this function does have a limit. More precisely, consider the function f...
    103 KB (13,450 words) - 00:29, 22 November 2024
  • Thumbnail for Howard Carmichael
    Howard John Carmichael (born 17 January 1950) is a British-born New Zealand theoretical physicist specialising in quantum optics and the theory of open...
    19 KB (2,026 words) - 15:28, 13 October 2024
  • In mathematics, a Lucas–Carmichael number is a positive composite integer n such that if p is a prime factor of n, then p + 1 is a factor of n + 1; n is...
    7 KB (327 words) - 11:01, 15 October 2024
  • 2015 – Lucas–Carmichael number 2016 – triangular number, number of 5-cubes in a 9-cube, Erdős–Nicolas number, 211-25 2017 – Mertens function zero, sexy...
    32 KB (4,691 words) - 08:17, 21 November 2024