Number Theory Carbondale 1979 : Proceedings of the Southern Illinois Number Theory Conference Carbondale, March 30 and 31, 1979
Bewaard in:
| Coauteur: | |
|---|---|
| Andere auteurs: | |
| Formaat: | Livre numérique |
| Taal: | Anglais |
| Gepubliceerd in: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Reeks: | Lecture notes in mathematics
751 |
| Onderwerpen: | |
| Online toegang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Opmerking: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Number theory, Carbondale 1979, proceedings of the Southern Illinois number theory conference, Carbondale, March 30 and 31, 1979, edited by Melvyn B. Nathanson, 1979, Berlin [etc.], Springer-Verlag, 1 vol. (342 p.), Lecture notes in mathematics, 3-540-09559-4 • Number Theory, Carbondale 1979, Texte imprimé, 9783662162040 |
Inhoudsopgave:
- On certain irrational values of the logarithm
- Recent results on fractional parts of polynomials
- On the development of Gelfond's method
- Transcendental numbers
- Diophantine equations over ?(t) and complex multiplication
- Abhyankar's lemma and the class group
- Systems of distinct representatives and minimal bases in additive number theory
- Conjectures on elliptic curves over quadratic fields
- Ultrafilters and combinatorial number theory
- Some results related to minimal discriminants
- Cyclic cubic fields that contain an integer of given index
- Unique and almost unique factorization
- Hecke Weil Jacquet Langlands theorem revisited
- Where are number fields with small class number?
- Künneth formula for L-functions
- The Hausdorff dimension of a set of non-normal well approximable numbers
- A combinatorial problem in additive number theory
- The number of bits in a product of odd integers
- Prime discriminants in real quadratic fields of narrow class number one
- Additive h-bases for n
- A running time analysis of Brillhart's continued fraction factoring method.