Submitted by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2015-10-16T15:00:20Z No. of bitstreams: 1 arquivototal.pdf: 971519 bytes, checksum: 75c5acddc58c0f9e43eb4d646a3fa8fd (MD5) / Approved for entry into archive by Maria Suzana Diniz (msuzanad@hotmail.com) on 2015-10-16T22:38:36Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 971519 bytes, checksum: 75c5acddc58c0f9e43eb4d646a3fa8fd (MD5) / Made available in DSpace on 2015-10-16T22:38:36Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 971519 bytes, checksum: 75c5acddc58c0f9e43eb4d646a3fa8fd (MD5) Previous issue date: 2013-08-14 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / This work deals with the study of the binomial developments started in the late years of Elementary School, when we deal with notable products, which is complemented in the second year of High School, from the study of Newton's Binomial. We will make a detailed study of the same, through a historical overview about the subject, properties of arithmetic triangle (Pascal's triangle / Tartaglia's), reaching the binomial theorem and, nally, some applications of these results in solving various problems, in the multinomial expanding and in the binomial series. / Este trabalho vem mostrar o estudo dos desenvolvimentos binomiais iniciado na 7a série (8o ano) do Ensino Fundamental, quando tratamos de produtos notáveis, que é complementado na segunda série do ensino médio, a partir do estudo do Binômio de Newton. Faremos um estudo detalhado do mesmo, passando por um apanhado histórico sobre o assunto, propriedades do triângulo aritmético (triângulo de Pascal/Tartaglia), chegando ao Teorema binomial e, por m, a algumas aplicações destes na resolução de problemas diversos, expansão multinomial e nas séries binomiais.

An urn contains two types of balls: p "+t" balls and m "-s" balls, where t and s are positive real numbers. The balls are drawn from the urn uniformly at random without replacement until the urn is empty. Before each ball is drawn, the player decides whether to accept the ball or not. If the player opts to accept the ball, then the payoff is the weight of the ball drawn, gaining t dollars if a "+t" ball is drawn, or losing s dollars if a "-s" ball is drawn. We wish to maximize the expected gain for the player. We find that the optimal acceptance policies are similar to that of the original acceptance urn of Chen et al. with s=t=1. We show that the expected gain function also shares similar properties to those shown in that work, and note the important properties that have geometric interpretations. We then calculate the expected gain for the urns with t/s rational, using various methods, including rotation and reflection. For the case when t/s is irrational, we use rational approximation to calculate the expected gain. We then give the asymptotic value of the expected gain under various conditions. The problem of minimal gain is then considered, which is a version of the ballot problem. We then consider a Bayesian approach for the general urn, for which the number of balls n is known while the number of "+t" balls, p, is unknown. We find formulas for the expected gain for the random acceptance urn when the urns with n balls are distributed uniformly, and find the asymptotic value of the expected gain for any s and t. Finally, we discuss the probability of ruin when an optimal strategy is used for the (m,p;s,t) urn, solving the problem with s=t=1. We also show that in general, when the initial capital is large, ruin is unlikely. We then examine the same problem with the random version of the urn, solving the problem with s=t=1 and an initial prior distribution of the urns containing n balls that is uniform.