Thèse - Clermont-Ferrand. / Bibliography: l. [92].

When choosing k random elements from a group the kth expectation number is the expected size of the subgroup generated by those specific elements. The main purpose of this thesis is to study the asymptotic properties for the first and second expectation numbers of large cyclic groups. The first chapter introduces the kth expectation number. This formula allows us to determine the expected size of any group. Explicit examples and computations of the first and second expectation number are given in the second chapter. Here we show example of both cyclic and dihedral groups. In chapter three we discuss arithmetic functions which are crucial to computing the first and second expectation numbers. The fourth chapter is where we introduce and prove asymptotic results for the first expectation number of large cyclic groups. The asymptotic results for the second expectation number of cyclic groups is given in the fifth chapter. Finally, the results are summarized and future work for expectation numbers is discussed.

L-functions form a connection between elliptic curves and modular forms. The goals of this thesis will be to discuss this connection, and to see similar connections for arithmetic functions.

Neste estudo, apresentamos conteúdos matemáticos adaptáveis tanto para os anos finais do ensino fundamental quanto para o ensino médio. Iniciamos com um conjunto de ideias preliminares: indução matemática, triângulo de Pascal, Binômio de Newton e relações trigonométricas, para a obtenção de fórmulas de somas finitas, em que os valores das parcelas são computados sobre números inteiros consecutivos, e da técnica de transformação de soma finita em telescópica. Enunciamos Progressões Aritméticas e Geométricas como sequências numéricas e suas propriedades, obtendo a soma de seus n primeiros termos, associando com propriedades do triângulo de Pascal. Por fim, descrevemos Funções Aritméticas, Funções Aritméticas Totalmente Multiplicativas e Fortemente Multiplicativas, como sequências de números naturais, com suas operações e propriedades, direcionando ao objetivo de calcular o número de divisores naturais de n, a soma de todos os divisores naturais de n, e assim por diante. Como consequência, exibimos a fórmula de contagem do número de polinômios mônicos irredutíveis. / In this study, we present mathematical content that is adaptable to both of the final years of elementary school and to high school. We start with a set of preliminary ideas: mathematical induction, Pascal\'s triangle, Newton\'s binomial and trigonometric relations, to obtain finite sum formulas, where the parts are computed on consecutive integers, and the technique for transforming a finite sum in telescopic one. We state the Arithmetic and Geometric Progressions as numerical sequences and study their properties, obtaining the sum of their n first terms, associating with properties of the Pascal\'s triangle. Finally, we describe the Arithmetic, Totally Multiplicative and Strongly Multiplicative Arithmetic Functions, as sequences of natural numbers, with their operations and properties, as a way to calculating the number of natural divisors of n, the sum of all natural divisors of n, and so on. As a consequence, we obtain the counting formula of the number of irreducible mononical polynomials.

Neste estudo, apresentamos conteúdos matemáticos adaptáveis tanto para os anos finais do ensino fundamental quanto para o ensino médio. Iniciamos com um conjunto de ideias preliminares: indução matemática, triângulo de Pascal, Binômio de Newton e relações trigonométricas, para a obtenção de fórmulas de somas finitas, em que os valores das parcelas são computados sobre números inteiros consecutivos, e da técnica de transformação de soma finita em telescópica. Enunciamos Progressões Aritméticas e Geométricas como sequências numéricas e suas propriedades, obtendo a soma de seus n primeiros termos, associando com propriedades do triângulo de Pascal. Por fim, descrevemos Funções Aritméticas, Funções Aritméticas Totalmente Multiplicativas e Fortemente Multiplicativas, como sequências de números naturais, com suas operações e propriedades, direcionando ao objetivo de calcular o número de divisores naturais de n, a soma de todos os divisores naturais de n, e assim por diante. Como consequência, exibimos a fórmula de contagem do número de polinômios mônicos irredutíveis. / In this study, we present mathematical content that is adaptable to both of the final years of elementary school and to high school. We start with a set of preliminary ideas: mathematical induction, Pascal\'s triangle, Newton\'s binomial and trigonometric relations, to obtain finite sum formulas, where the parts are computed on consecutive integers, and the technique for transforming a finite sum in telescopic one. We state the Arithmetic and Geometric Progressions as numerical sequences and study their properties, obtaining the sum of their n first terms, associating with properties of the Pascal\'s triangle. Finally, we describe the Arithmetic, Totally Multiplicative and Strongly Multiplicative Arithmetic Functions, as sequences of natural numbers, with their operations and properties, as a way to calculating the number of natural divisors of n, the sum of all natural divisors of n, and so on. As a consequence, we obtain the counting formula of the number of irreducible mononical polynomials.

La fonction de Möbius est définie par$$\mu(n)= \begin{cases} 1 & \textit{si $n=1$},\\ (-1)^k& \textit{si n est le produit de k nombres premiers distincts,}\\ 0 & \textit{si n contient un facteur carré. } \end{cases}$$Nous avons démontré que pour $x \ge \exp( 10^9) $ et $h=x^{1-\frac{1}{16000}}$, il existe dans chaque intervalle $[x-h,x]$ des entiers $n_1$ avec $\mu(n_1)=1$ et des entiers $n_2$ avec $\mu(n_2)=-1$.\\Ce résultat est une conséquence d'un résultat plus général.\\Pour $x \ge \exp(4\times 10^6)$, $\frac{1}{\sqrt{\log x}} \le \theta \le \frac{1}{2000}$, $h=x^{1-\theta}$ et $Q=(x/h)^{\frac{1}{20}}$, nous avons \\$$\sum_{q \leq Q} \log(Q/q)\sum_{\chi mod q}^*\left| \sum_{x.-h\le n \le x} \mu(n) \chi(n) \right| \leq 10^{20} h \theta \log(x) \exp( \frac{-1}{300 \theta}); $$la somme $\sum^*$ portant sur les caractères primitifs sauf l'éventuel caractère exceptionnel.\\Et en particulier pour $x \ge \exp( 10^9)$,$$ \left | \sum_{x.-x^{1-\frac{1}{16000}}\le n \le x} \mu(n) \right | \le \frac{1}{100} x^{1-\frac{1}{16000}}.\\$$ / The Möbius function is defined by$$\mu(n)= \begin{cases} 1 & \textit{if $n=1$},\\ (-1)^k& \textit{if n is a product of k distinct prime numbers,}\\ 0 & \textit{if n contains a square factor. } \end{cases}$$We demonstrate that for $x \ge \exp( 10^9) $ and $h=x^{1-\frac{1}{16000}}$, it exists in each interval $[x-h,x]$ integers $n_1$ with $\mu(n_1)=1$ and integers $n_2$ with $\mu(n_2)=-1$.\\This result is a consequence of a more general result. \\For $x \ge \exp(4\times 10^6)$, $\frac{1}{\sqrt{\log x}} \le \theta \le \frac{1}{2000}$, $h=x^{1-\theta}$ et $Q=(x/h)^{\frac{1}{20}}$, we have \\ $$\sum_{q \leq Q} \log(Q/q)\sum_{\chi mod q}^*\left| \sum_{x-h \le n \le x} \mu(n) \chi(n) \right| \leq 10^{20} h \theta \log(x) \exp( \frac{-1}{300 \theta}); $$the sum $\sum^*$ relating to primitive characters except for possible exceptional character.\\And in particular for $x \ge \exp( 10^9)$,$$\left | \sum_{x-.x^{1-\frac{1}{16000}}\le n \le x} \mu(n) \right | \le \frac{1}{100} x^{1-\frac{1}{16000}}.$$