Lehmer's totient problem
id:
lehmer-s-totient-problem-201-170436
title:
Lehmer's totient problem
text:
In mathematics, Lehmer's totient problem asks whether there is any composite number n such that Euler's totient function φ(n) divides n − 1. This is an unsolved problem. It is known that φ(n) = n − 1 if and only if n is prime. So for every prime number n, we have φ(n) = n − 1 and thus in particular φ(n) divides n − 1. D. H. Lehmer conjectured in 1932 that there are no composite numbers with this property.
brand slug:
wiki
category slug:
encyclopedia
description:
Unsolved problem in mathematics
original url:
https://en.wikipedia.org/wiki/Lehmer%27s_totient_problem
date created:
date modified:
2024-04-08T20:08:56Z
main entity:
{"identifier":"Q3406228","url":"https://www.wikidata.org/entity/Q3406228"}
image:
fields total:
13
integrity:
14