We define the Carmichael function as the smallest integer Lambda(n) such that

k**Lambda(n)=1 (mod n) for all k relatively prime to n.

I have obtained the following result:

Lambda(n!)=n!/(2·n#) for all n >=5

n#=product (primes<=n)) (Primorial)

Sincelrely

Sebastián Martín Ruiz

[Non-text portions of this message have been removed]