Results 141 to 150 of about 6,614,784 (187)

Subsequence Sums

Combinatorics, Probability and Computing, 2003
Let \(G\) be a cyclic group of order \(n\) and let \(\mu= \{x_1, x_2,\dots, x_m\}\) be a sequence of elements of \(G\). The number of distinct values taken by \(\mu\) will be denoted by \(k\) and the set of sums of the \(n\)-subsequence of \(\mu\) by \(n\wedge\mu\).
openaire   +2 more sources

Character sums with subsequence sums

Periodica Mathematica Hungarica, 2007
Let χ be a primitive multiplicative character modulo an integer m ≥ 1. Using some classical bounds of character sums, we estimate the average value of the character sums with subsequence sums \( T_m (\mathcal{S},\chi ) = \sum\nolimits_{\mathcal{I} \subseteq \{ 1, \ldots ,N\} } {\chi (\sum\nolimits_{i \in \mathcal{I}} {s_i } )} \) taken over all N ...
Sanka Balasuriya, Igor E. Shparlinski
openaire   +1 more source

Euler sums and Stirling sums

Journal of Number Theory, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Weiping, Lyu, Yanhong
openaire   +1 more source

Farey Sums and Dedekind Sums

The American Mathematical Monthly, 2010
(2010). Farey Sums and Dedekind Sums. The American Mathematical Monthly: Vol. 117, No. 1, pp. 72-78.
openaire   +2 more sources

Possum, ergo Sum—Nequeo, ergo Sum qui Sum

1995
Highly competent people have more success in life, both actively because they are able to act in ways which secure attainment of their goals, and passively, because they are attractive to other people. Typically, highly competent people are also proud of themselves.
openaire   +1 more source

Home - About - Disclaimer - Privacy