962 resultados para Number Theory
Resumo:
In this paper we study generalised prime systems for which the integer counting function NP(x) is asymptotically well behaved, in the sense that NP(x)=ρx+O(xβ), where ρ is a positive constant and . For such systems, the associated zeta function ζP(s) is holomorphic for . We prove that for , for any ε>0, and also for ε=0 for all such σ except possibly one value. The Dirichlet divisor problem for generalised integers concerns the size of the error term in NkP(x)−Ress=1(ζPk(s)xs/s), which is O(xθ) for some θ<1. Letting αk denote the infimum of such θ, we show that .
Resumo:
Let C be a smooth, absolutely irreducible genus 3 curve over a number field M. Suppose that the Jacobian of C has complex multiplication by a sextic CM-field K. Suppose further that K contains no imaginary quadratic subfield. We give a bound on the primes p of M such that the stable reduction of C at p contains three irreducible components of genus 1.
Resumo:
We extend the method of Cassels for computing the Cassels-Tate pairing on the 2-Selmer group of an elliptic curve, to the case of 3-Selmer groups. This requires significant modifications to both the local and global parts of the calculation. Our method is practical in sufficiently small examples, and can be used to improve the upper bound for the rank of an elliptic curve obtained by 3-descent.
Resumo:
Let E/Q be an elliptic curve and p a rational prime of good ordinary reduction. For every imaginary quadratic field K/Q satisfying the Heegner hypothesis for E we have a corresponding line in E(K)\otimes Q_p, known as a shadow line. When E/Q has analytic rank 2 and E/K has analytic rank 3, shadow lines are expected to lie in E(Q)\otimes Qp. If, in addition, p splits in K/Q, then shadow lines can be determined using the anticyclotomic p-adic height pairing. We develop an algorithm to compute anticyclotomic p-adic heights which we then use to provide an algorithm to compute shadow lines. We conclude by illustrating these algorithms in a collection of examples.
Resumo:
We prove that
∑k,ℓ=1N(nk,nℓ)2α(nknℓ)α≪N2−2α(logN)b(α)
holds for arbitrary integers 1≤n1<⋯
Resumo:
We present a complete description of the analytic properties of the Barnes double zeta and Gamma functions. (C) 2009 Elsevier Inc. All rights reserved.
Resumo:
Investigates what can go wrong when dynamical systems are modelled with a computer. Number theoretic techniques were used to detail the effects "discretization" errors caused by computer round-off had on characteristics of a system. In particular, a relationship was established between the occurrence of long cycles in a system and the classical result known as Artin's conjecture. Algorithms were then developed which eliminated discretization errors.
Resumo:
The RSA scheme is used to sign messages; however, in order to avoid forgeries, a message can be padded with a fixed string of data P. De Jonge and Chaum showed in 1985 that forgeries can be constructed if the size of P (measured in bytes) is less than the size of N/3, where N is the RSA modulus. Girault and Misarsky then showed in 1997 that forgeries can be constructed if the size of P is less than the size of N/2. In 2001, Brier, Clavier, Coron and Naccache showed that forgeries can still be constructed when the size of P is less than two thirds the size of N. In this paper, we demonstrate that this padding scheme is always insecure; however, the complexity of actually finding a forgery is O(N). We then focus specifically on the next unsettled case, where P is less than 3/4 the size of N and show that finding a forgery is equivalent to solving a set of diophantine equations. While we are not able to solve these equations, this work may lead to a break-through by means of algebraic number theory techniques.
Resumo:
The present thesis is an analysis of Adrien-Marie Legendre s works on Number Theory, with a certain emphasis on his 1830 edition of Theory of Numbers. The role played by these works in their historical context and their influence on the development of Number Theory was investigated. A biographic study of Legendre (1752-1833) was undertaken, in which both his personal relations and his scientific productions were related to certain historical elements of the development of both his homeland, France, and the sciences in general, during the 18th and 19th centuries This study revealed notable characteristics of his personality, as well as his attitudes toward his mathematical contemporaries, especially with regard to his seemingly incessant quarrels with Gauss about the priority of various of their scientific discoveries. This is followed by a systematic study of Lagrange s work on Number Theory, including a comparative reading of certain topics, especially that of his renowned law of quadratic reciprocity, with texts of some of his contemporaries. In this way, the dynamics of the evolution of his thought in relation to his semantics, the organization of his demonstrations and his number theoretical discoveries was delimited. Finally, the impact of Legendre s work on Number Theory on the French mathematical community of the time was investigated. This investigation revealed that he not only made substantial contributions to this branch of Mathematics, but also inspired other mathematicians to advance this science even further. This indeed is a fitting legacy for his Theory of Numbers, the first modern text on Higher Arithmetic, on which he labored half his life, producing various editions. Nevertheless, Legendre also received many posthumous honors, including having his name perpetuated on the Trocadéro face of the Eiffel Tower, which contains a list of 72 eminent scientists, and having a street and an alley in Paris named after him
Resumo:
The present dissertation analyses Leonhard Euler´s early mathematical work as Diophantine Equations, De solutione problematum diophanteorum per números íntegros (On the solution of Diophantine problems in integers). It was published in 1738, although it had been presented to the St Petersburg Academy of Science five years earlier. Euler solves the problem of making the general second degree expression a perfect square, i.e., he seeks the whole number solutions to the equation ax2+bx+c = y2. For this purpose, he shows how to generate new solutions from those already obtained. Accordingly, he makes a succession of substitutions equating terms and eliminating variables until the problem reduces to finding the solution of the Pell Equation. Euler erroneously assigns this type of equation to Pell. He also makes a number of restrictions to the equation ax2+bx+c = y and works on several subthemes, from incomplete equations to polygonal numbers
Resumo:
Among the many methodological resources that the mathematics teacher can use in the classroom, we can cite the History of Mathematics which has contributed to the development of activities that promotes students curiosity about mathematics and its history. In this regard, the present dissertation aims to translate and analyze, mathematically and historically, the three works of Euler about amicable numbers that were writed during the Eighteenth century with the same title: De numeris amicabilibus. These works, despite being written in 1747 when Euler lived in Berlin, were published in different times and places. The first, published in 1747 in Nova Acta Eruditorum and which received the number E100 in the Eneström index, summarizes the historical context of amicable numbers, mentions the formula 2nxy & 2nz used by his precursors and presents a table containing thirty pairs of amicable numbers. The second work, E152, was published in 1750 in Opuscula varii argument. It is the result of a comprehensive review of Euler s research on amicable numbers which resulted in a catalog containing 61 pairs, a quantity which had never been achieved by any mathematician before Euler. Finally, the third work, E798, which was published in 1849 at the Opera postuma, was probably the first among the three works, to be written by Euler
Resumo:
The conductor-discriminant formula, namely, the Hasse Theorem, states that if a number field K is fixed by a subgroup H of Gal(Q(zeta(n))/Q), the discriminant of K can be obtained from H by computing the product of the conductors of all characters defined modulo n which are associated to K. By calculating these conductors explicitly, we derive a formula to compute the discriminant of any subfield of Q(zeta(p)r), where p is an odd prime and r is a positive integer. (C) 2002 Elsevier B.V. (USA).
Resumo:
Group theoretical-based techniques and fundamental results from number theory are used in order to allow for the construction of exact projectors in finite-dimensional spaces. These operators are shown to make use only of discrete variables, which play the role of discrete generator coordinates, and their application in the number symmetry restoration is carried out in a nuclear BCS wave function which explicitly violates that symmetry. © 1999 Published by Elsevier Science B.V. All rights reserved.