Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Bryant Tuckerman"'
Autor:
Ramesh C. Agarwal, Fred G. Gustavson, James B. Shearer, J.W. Cooley, Gordon Robert Slishman, Bryant Tuckerman
Publikováno v:
IBM Journal of Research and Development. 30:126-144
Algorithms have been developed to compute short- and long-precision elementary functions: SIN, COS, TAN, COTAN, LOG, LOG10, EXP, POWER, SQRT, ATAN, ASIN, ACOS, ATAN2, and CABS, in scalar (28 functions) and vector (22 functions) mode. They have been i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b119e2436d0a62298350fcb31a49a515
https://doi.org/10.1147/rd.302.0126
https://doi.org/10.1147/rd.302.0126
Publikováno v:
The American Mathematical Monthly. 45:106-111
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ce6796184daf360658db65b119cc7ef
https://doi.org/10.1080/00029890.1938.11990776
https://doi.org/10.1080/00029890.1938.11990776
Autor:
Bryant Tuckerman
Publikováno v:
Mathematics of Computation. 27:943-949
An infinite tree-generating "q-algorithm" is defined, which if executed would enumerate all odd perfect numbers (opn’s). A truncated execution shows that any opn has either some component p a > 10 18 {p^a} > {10^{18}} , with a even, or no divisor >
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb4bc3c7a864f9746cdda1cecf914571
https://doi.org/10.1090/s0025-5718-1973-0325506-7
https://doi.org/10.1090/s0025-5718-1973-0325506-7
Publikováno v:
Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0869559943e08169947f1bfc2e525b1e
https://doi.org/10.1090/conm/022/07
https://doi.org/10.1090/conm/022/07
Publikováno v:
Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1378404dda986a73d1ff6f2bdf4e9043
https://doi.org/10.1090/conm/022/08
https://doi.org/10.1090/conm/022/08
Publikováno v:
Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::235097a9d5744a231ef89127f1b5d708
https://doi.org/10.1090/conm/022/06
https://doi.org/10.1090/conm/022/06
Publikováno v:
Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d20518c993a823126a0ed32d63516527
https://doi.org/10.1090/conm/022/03
https://doi.org/10.1090/conm/022/03
Publikováno v:
Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25a4e6e361d77aff87f70ad1f725e1cb
https://doi.org/10.1090/conm/022/05
https://doi.org/10.1090/conm/022/05
Publikováno v:
Contemporary Mathematics ISBN: 9780821850787
Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8cb5c07a359e50311d9c64ba955f08b6
https://doi.org/10.1090/conm/022
https://doi.org/10.1090/conm/022
Publikováno v:
Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7295d697e126e9181db5d6875395cd1
https://doi.org/10.1090/conm/022/04
https://doi.org/10.1090/conm/022/04