About: Division lattice     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FDivision_lattice&invfp=IFP_OFF&sas=SAME_AS_OFF

The division lattice is an infinite complete bounded distributive lattice whose elements are the natural numbers ordered by divisibility. Its least element is 1, which divides all natural numbers, while its greatest element is 0, which is divisible by all natural numbers. The meet operation is greatest common divisor while the join operation is least common multiple. The prime numbers are precisely the atoms of the division lattice, namely those natural numbers divisible only by themselves and 1.

AttributesValues
rdfs:label
  • Division lattice (en)
rdfs:comment
  • The division lattice is an infinite complete bounded distributive lattice whose elements are the natural numbers ordered by divisibility. Its least element is 1, which divides all natural numbers, while its greatest element is 0, which is divisible by all natural numbers. The meet operation is greatest common divisor while the join operation is least common multiple. The prime numbers are precisely the atoms of the division lattice, namely those natural numbers divisible only by themselves and 1. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • The division lattice is an infinite complete bounded distributive lattice whose elements are the natural numbers ordered by divisibility. Its least element is 1, which divides all natural numbers, while its greatest element is 0, which is divisible by all natural numbers. The meet operation is greatest common divisor while the join operation is least common multiple. The prime numbers are precisely the atoms of the division lattice, namely those natural numbers divisible only by themselves and 1. For any square-free number n, its divisors form a Boolean algebra that is a sublattice of the division lattice. The elements of this sublattice are representable as the subsets of the set of prime factors of n. The converse also holds, namely that every sublattice of the division lattice that forms a Boolean algebra is the lattice of divisors of a square-free number. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software