Geodesic
Primitive sequences whose elements have no large prime factors
Glasgow mathematical journal, Tome 10 (1969) no. 1, pp. 10-15

Voir la notice de l'article provenant de la source Cambridge University Press

A sequence a1 < a2 < ... of positive integers is said to be primitive if no element of the sequence divides any other. The study of primitive sequences arose naturally out of investigations into the subject of abundant numbers, where sequences each of whose elements is of the form , the pi being fixed primes, are of particular importance. Such a sequence is said to be built up from the primes p1...pr. Thus Dickson [1], in an early paper on abundant numbers, proved that a primitive sequence built up from a fixed set of primes is necessarily finite. 
Anderson, Ian. Primitive sequences whose elements have no large prime factors. Glasgow mathematical journal, Tome 10 (1969) no. 1, pp. 10-15. doi: 10.1017/S001708950000046X
@article{10_1017_S001708950000046X,
     author = {Anderson, Ian},
     title = {Primitive sequences whose elements have no large prime factors},
     journal = {Glasgow mathematical journal},
     pages = {10--15},
     year = {1969},
     volume = {10},
     number = {1},
     doi = {10.1017/S001708950000046X},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S001708950000046X/}
}
TY  - JOUR
AU  - Anderson, Ian
TI  - Primitive sequences whose elements have no large prime factors
JO  - Glasgow mathematical journal
PY  - 1969
SP  - 10
EP  - 15
VL  - 10
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S001708950000046X/
DO  - 10.1017/S001708950000046X
ID  - 10_1017_S001708950000046X
ER  - 
%0 Journal Article
%A Anderson, Ian
%T Primitive sequences whose elements have no large prime factors
%J Glasgow mathematical journal
%D 1969
%P 10-15
%V 10
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/S001708950000046X/
%R 10.1017/S001708950000046X
%F 10_1017_S001708950000046X

[1] 1.Dickson, L. E., Finiteness of the odd perfect and primitive numbers with n distinct prime factors, Amer. J. Math. 35 (1913), 413–422. Google Scholar | DOI

[2] 2.Erdös, P., Sárkösy, A. and Szemerédi, E., On an extremal problem concerning primitive sequences, J. London Math, Soc. 42 (1967), 484–488. Google Scholar

Cité par Sources :