EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 201 – 220 of 245

Bounds for frequencies of residues of second-order recurrences modulo $p^{r}$

Walter Carlip, Lawrence Somer (2007)

Mathematica Bohemica

The authors examine the frequency distribution of second-order recurrence sequences that are not $p$ -regular, for an odd prime $p$ , and apply their results to compute bounds for the frequencies of $p$ -singular elements of $p$ -regular second-order recurrences modulo powers of the prime $p$ . The authors’ results have application to the $p$ -stability of second-order recurrence sequences.

Bounds for linear recurrences with restricted coefficients.

Berenhaut, Kenneth S., Lund, Robert (2003)

JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]

Bounds for modular L-functions in the level aspect

Valentin Blomer, Gergely Harcos, Philippe Michel (2007)

Annales scientifiques de l'École Normale Supérieure

Bounds for quadratic Waring's problem

Myung-Hwan Kim, Byeong-Kweon Oh (2002)

Acta Arithmetica

Bounds for solutions of additive equations in an algebraic number field I

Wang Yuan (1987)

Acta Arithmetica

Bounds for solutions of additive equations in an algebraic number field II

Wang Yuan (1987)

Acta Arithmetica

Bounds for solutions of diagonal equations

Jane Pitman (1971)

Acta Arithmetica

Bounds for solutions of diagonal inequalities

Jane Pitman (1971)

Acta Arithmetica

Bounds for solutions of two additive equations of odd degree [Book]

Ralph Haeger Toliver (1989)

Bounds for the 3x+1 problem using difference inequalities

Ilia Krasikov, Jeffrey C. Lagarias (2003)

Acta Arithmetica

Bounds for the average $L^{p}$ -extreme and the $L^{\infty}$ -extreme discrepancy.

Gnewuch, Michael (2005)

The Electronic Journal of Combinatorics [electronic only]

Bounds for the counting function of the Jordan-Pólya numbers

Jean-Marie De Koninck, Nicolas Doyon, A. Arthur Bonkli Razafindrasoanaivolala, William Verreault (2020)

Archivum Mathematicum

A positive integer $n$ is said to be a Jordan-Pólya number if it can be written as a product of factorials. We obtain non-trivial lower and upper bounds for the number of Jordan-Pólya numbers not exceeding a given number $x$ .

Currently displaying 201 – 220 of 245

Previous Page 11 Next

Displaying 201 – 220 of 245

Bounds for frequencies of residues of second-order recurrences modulo $p^{r}$

Bounds for linear recurrences with restricted coefficients.

Bounds for modular L-functions in the level aspect

Bounds for quadratic Waring's problem

Bounds for solutions of additive equations in an algebraic number field I

Bounds for solutions of additive equations in an algebraic number field II

Bounds for solutions of diagonal equations

Bounds for solutions of diagonal inequalities

Bounds for solutions of two additive equations of odd degree [Book]

Bounds for the 3x+1 problem using difference inequalities

Bounds for the average $L^{p}$ -extreme and the $L^{\infty}$ -extreme discrepancy.

Bounds for the counting function of the Jordan-Pólya numbers

Bounds for the degrees of CM-fields of class number one

Bounds for the density of abundant integers.

Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences

Bounds for the eventual positivity of difference functions of partitions into prime powers.

Bounds for the Kolakoski sequence.

Bounds for the minimal solution of genus zero diophantine equations

Bounds for the order of the Tate-Shafarevich group

Bounds for the smallest integer point of a rational curve

Currently displaying 201 – 220 of 245