Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Lehmers_totient_problem> ?p ?o }
Showing triples 1 to 36 of
36
with 100 triples per page.
- Lehmers_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). Such a number must also be a Carmichael Number.".
- Lehmers_totient_problem wikiPageID "39052718".
- Lehmers_totient_problem wikiPageLength "2750".
- Lehmers_totient_problem wikiPageOutDegree "10".
- Lehmers_totient_problem wikiPageRevisionID "687269102".
- Lehmers_totient_problem wikiPageWikiLink Bulletin_of_the_American_Mathematical_Society.
- Lehmers_totient_problem wikiPageWikiLink Carmichael_number.
- Lehmers_totient_problem wikiPageWikiLink Category:Conjectures.
- Lehmers_totient_problem wikiPageWikiLink Category:Multiplicative_functions.
- Lehmers_totient_problem wikiPageWikiLink Derrick_Henry_Lehmer.
- Lehmers_totient_problem wikiPageWikiLink Eulers_totient_function.
- Lehmers_totient_problem wikiPageWikiLink Prime_number.
- Lehmers_totient_problem wikiPageWikiLink Springer_Science+Business_Media.
- Lehmers_totient_problem wikiPageWikiLinkText "Lehmer's totient problem".
- Lehmers_totient_problem id "LehmersTotientProblem".
- Lehmers_totient_problem title "Lehmer's Totient Problem".
- Lehmers_totient_problem wikiPageUsesTemplate Template:Cite_book.
- Lehmers_totient_problem wikiPageUsesTemplate Template:Cite_journal.
- Lehmers_totient_problem wikiPageUsesTemplate Template:For.
- Lehmers_totient_problem wikiPageUsesTemplate Template:MathWorld.
- Lehmers_totient_problem wikiPageUsesTemplate Template:Reflist.
- Lehmers_totient_problem subject Category:Conjectures.
- Lehmers_totient_problem subject Category:Multiplicative_functions.
- Lehmers_totient_problem type Conjecture.
- Lehmers_totient_problem type Function.
- Lehmers_totient_problem type Statement.
- Lehmers_totient_problem type Statement.
- Lehmers_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). Such a number must also be a Carmichael Number.".
- Lehmers_totient_problem label "Lehmer's totient problem".
- Lehmers_totient_problem sameAs Q3406228.
- Lehmers_totient_problem sameAs Problème_de_Lehmer.
- Lehmers_totient_problem sameAs m.0swnxpj.
- Lehmers_totient_problem sameAs Lehmers_problem.
- Lehmers_totient_problem sameAs Q3406228.
- Lehmers_totient_problem wasDerivedFrom Lehmers_totient_problem?oldid=687269102.
- Lehmers_totient_problem isPrimaryTopicOf Lehmers_totient_problem.