Revision as of 16:15, 30 January 2024 view source PureFox (talk \| contribs) 9,493 edits →‎{{header\|Wren}}: Optimized - significantly quicker than before. ← Older edit		Revision as of 17:19, 30 January 2024 view source Wherrera (talk \| contribs) 4,111 edits m sp Newer edit →
Line 4: ;Background The '''Carmichael function''', or '''Carmichael lambda function''', is a function in ~~numeric~~number theory. The Carmichael lambda {{math \| ''λ''(''n'')}} of a positive integer '''n''' is the smallest positive integer '''m''' such that :<math>a^m \equiv 1 \pmod{n}</math> holds for every integer coprime to '''n'''. Line 32: =={{header\|Python}}== Python has the Carmichael function in the SymPy library, where isit is called reduced_totient. <syntaxhighlight lang="Python">from sympy import reduced_totient Line 52: UP_TO = 20 MAX_TO_TEST = ~~1_000_000_000~~100_000_000_000 FIRSTS = [0] * (UP_TO + 1) FIRSTS[0] = 1

Carmichael lambda function: Difference between revisions