Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Lehmer's_totient_problem> ?p ?o. }
Showing items 1 to 16 of
16
with 100 items per page.
- Lehmer's_totient_problem abstract "In mathematics, Lehmer's totient problem, named for D. H. Lehmer, asks whether there is any composite number n such that Euler's totient function φ(n) divides n − 1. This is true of every prime number, and Lehmer conjectured in 1932 that there are no composite solutions: he showed that if any such n exists, it must be odd, square-free, and divisible by at least seven primes (i.e. ω(n) ≥ 7).".
- Lehmer's_totient_problem wikiPageID "39052718".
- Lehmer's_totient_problem wikiPageRevisionID "573564500".
- Lehmer's_totient_problem id "LehmersTotientProblem".
- Lehmer's_totient_problem title "Lehmer's Totient Problem".
- Lehmer's_totient_problem subject Category:Conjectures.
- Lehmer's_totient_problem subject Category:Multiplicative_functions.
- Lehmer's_totient_problem comment "In mathematics, Lehmer's totient problem, named for D. H. Lehmer, asks whether there is any composite number n such that Euler's totient function φ(n) divides n − 1. This is true of every prime number, and Lehmer conjectured in 1932 that there are no composite solutions: he showed that if any such n exists, it must be odd, square-free, and divisible by at least seven primes (i.e. ω(n) ≥ 7).".
- Lehmer's_totient_problem label "Lehmer's totient problem".
- Lehmer's_totient_problem label "Problème de Lehmer".
- Lehmer's_totient_problem sameAs Problème_de_Lehmer.
- Lehmer's_totient_problem sameAs m.0swnxpj.
- Lehmer's_totient_problem sameAs Q3406228.
- Lehmer's_totient_problem sameAs Q3406228.
- Lehmer's_totient_problem wasDerivedFrom Lehmer's_totient_problem?oldid=573564500.
- Lehmer's_totient_problem isPrimaryTopicOf Lehmer's_totient_problem.