Result: A variance method in combinatorial number theory
Title:
A variance method in combinatorial number theory
Authors:
Source:
Glasgow Mathematical Journal. 10:126-129
Publisher Information:
Cambridge University Press (CUP), 1969.
Publication Year:
1969
Subject Terms:
Document Type:
Academic journal
Article
File Description:
application/xml
Language:
English
ISSN:
1469-509X
0017-0895
0017-0895
DOI:
10.1017/s0017089500000677
Access URL:
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/92116DB66CA3611A309412A353E71211/S0017089500000677a.pdf/div-class-title-a-variance-method-in-combinatorial-number-theory-div.pdf
http://www.journals.cambridge.org/abstract_S0017089500000677
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S0017089500000677
http://www.journals.cambridge.org/abstract_S0017089500000677
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S0017089500000677
Rights:
Cambridge Core User Agreement
Accession Number:
edsair.doi.dedup.....0dd40cb6cd8ca1cf94a013acae89d529
Database:
OpenAIRE
Further Information
Let s = s(a1, a2,...., ar) denote the number of integer solutions of the equationsubject to the conditionsthe ai being given positive integers, and square brackets denoting the integral part. Clearly s (a1,..., ar) is also the number s = s(m) of divisors of which contain exactly λ prime factors counted according to multiplicity, and is therefore, as is proved in [1], the cardinality of the largest possible set of divisors of m, no one of which divides another.