Results 161 to 170 of about 7,643 (187)
Some of the next articles are maybe not open access.
Applications of the Sum-Product Theorem in Finite Fields
21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006Summary form only given. About two years ago Bourgain, Katz and Tao (2004) proved the following theorem, essentially stating that in every finite field, a set which does not grow much when we add all pairs of elements, and when we multiply all pairs of elements, must be very close to a subfield. Theorem 1: (Bourgain et al., 2004) For every /spl epsi/ >
openaire +1 more source
Series and Products in the Development of Mathematics
Summary We provide a simple recursive method for generating the finite sum of whole number powers of integers. Given that we know only the formula for the sum with power p – 1, this method generates the formula for the sum with power p by a simple ...
R. B. Dozier
semanticscholar +1 more source
Summary We provide a simple recursive method for generating the finite sum of whole number powers of integers. Given that we know only the formula for the sum with power p – 1, this method generates the formula for the sum with power p by a simple ...
R. B. Dozier
semanticscholar +1 more source
More on Finite Sums that Involve Reciprocals of Products of Generalized Fibonacci Numbers
2014See the abstract in the attached pdf.
openaire +2 more sources
Philosophical Transactions Series A, Mathematical, Physical, and Engineering Sciences, 2015
Philippe Michel
exaly
Philippe Michel
exaly

