Articles liés à Sylvester's Sequence: Number Theory, Sequence,...
Sylvester's Sequence: Number Theory, Sequence, Integer, Double Exponential Function, Multiplicative Inverse, Unit Fraction, Egyptian Fraction, Online Algorithm, Empty Product - Couverture souple
Synopsis
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In number theory, Sylvester''s sequence is a sequence of integers in which each member of the sequence is the product of the previous members, plus one. The first few terms of the sequence are: 2, 3, 7, 43, 1807, 3263443, 10650056950807, 113423713055421844361000443 (sequence A000058 in OEIS). Sylvester''s sequence is named after James Joseph Sylvester, who first investigated it in 1880. Its values grow doubly exponentially, and the sum of its reciprocals forms a series of unit fractions that converges to 1 more rapidly than any other series of unit fractions with the same sum. The recurrence by which it is defined allows the numbers in the sequence to be factored more easily than other numbers of the same magnitude, but, due to the rapid growth of the sequence, complete prime factorizations are known only for a few of its members. Values derived from this sequence have also been used to construct finite Egyptian fraction representations of 1, Sasakian Einstein manifolds, and hard instances for online algorithms.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Présentation de l'éditeur
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In number theory, Sylvester''s sequence is a sequence of integers in which each member of the sequence is the product of the previous members, plus one. The first few terms of the sequence are: 2, 3, 7, 43, 1807, 3263443, 10650056950807, 113423713055421844361000443 (sequence A000058 in OEIS). Sylvester''s sequence is named after James Joseph Sylvester, who first investigated it in 1880. Its values grow doubly exponentially, and the sum of its reciprocals forms a series of unit fractions that converges to 1 more rapidly than any other series of unit fractions with the same sum. The recurrence by which it is defined allows the numbers in the sequence to be factored more easily than other numbers of the same magnitude, but, due to the rapid growth of the sequence, complete prime factorizations are known only for a few of its members. Values derived from this sequence have also been used to construct finite Egyptian fraction representations of 1, Sasakian Einstein manifolds, and hard instances for online algorithms.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Sylvester's Sequence: Number Theory, Sequence,...
Image fournie par le vendeur
Sylvester's Sequence
Edité par
VDM Verlag Dr. Müller E.K. Feb 2010, 2010
ISBN 10 : 6130356722
ISBN 13 : 9786130356729
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -High Quality Content by WIKIPEDIA articles! In number theory, Sylvester's sequence is a sequence of integers in which each member of the sequence is the product of the previous members, plus one. The first few terms of the sequence are: 2, 3, 7, 43, 1807, 3263443, 10650056950807, 113423713055421844361000443 (sequence A000058 in OEIS). Sylvester's sequence is named after James Joseph Sylvester, who first investigated it in 1880. Its values grow doubly exponentially, and the sum of its reciprocals forms a series of unit fractions that converges to 1 more rapidly than any other series of unit fractions with the same sum. The recurrence by which it is defined allows the numbers in the sequence to be factored more easily than other numbers of the same magnitude, but, due to the rapid growth of the sequence, complete prime factorizations are known only for a few of its members. Values derived from this sequence have also been used to construct finite Egyptian fraction representations of 1, Sasakian Einstein manifolds, and hard instances for online algorithms. Englisch. N° de réf. du vendeur 9786130356729
Acheter neuf
EUR 29
Expédition à EUR 23
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Sylvester's Sequence : Number Theory, Sequence, Integer, Double Exponential Function, Multiplicative Inverse, Unit Fraction, Egyptian Fraction, Online Algorithm, Empty Product
Edité par
VDM Verlag Dr. Müller E.K., 2010
ISBN 10 : 6130356722
ISBN 13 : 9786130356729
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In number theory, Sylvester's sequence is a sequence of integers in which each member of the sequence is the product of the previous members, plus one. The first few terms of the sequence are: 2, 3, 7, 43, 1807, 3263443, 10650056950807, 113423713055421844361000443 (sequence A000058 in OEIS). Sylvester's sequence is named after James Joseph Sylvester, who first investigated it in 1880. Its values grow doubly exponentially, and the sum of its reciprocals forms a series of unit fractions that converges to 1 more rapidly than any other series of unit fractions with the same sum. The recurrence by which it is defined allows the numbers in the sequence to be factored more easily than other numbers of the same magnitude, but, due to the rapid growth of the sequence, complete prime factorizations are known only for a few of its members. Values derived from this sequence have also been used to construct finite Egyptian fraction representations of 1, Sasakian Einstein manifolds, and hard instances for online algorithms. N° de réf. du vendeur 9786130356729
Acheter neuf
EUR 31,21
Expédition à EUR 60,59
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)