Results 11  20
of
8,418
Multiple Zeta Values At NonPositive Integers
, 1999
"... Values of EulerZagier's multiple zeta function at nonpositive integers are studied, especially at (0; 0; : : : ; n) and ( n; 0; : : : ; 0). Further we prove a symmetric formula among values at nonpositive integers. ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
Values of EulerZagier's multiple zeta function at nonpositive integers are studied, especially at (0; 0; : : : ; n) and ( n; 0; : : : ; 0). Further we prove a symmetric formula among values at nonpositive integers.
On Positive Integers n with a Certain Divisibility Property
"... In this paper, we study the positive integers n having at least two distinct prime factors such that the sum of the prime factors of n divides 2 n−1 − 1. 1 ..."
Abstract
 Add to MetaCart
In this paper, we study the positive integers n having at least two distinct prime factors such that the sum of the prime factors of n divides 2 n−1 − 1. 1
ON A CLASS OF DENSITIES OF SETS OF POSITIVE INTEGERS
, 2003
"... A method proposed by R. Alexander in his paper published in Acta Arithmetica XII (1967) enables to obtain various densities of set of positive integers, including asymptotic and logarithmic ones. In our paper some properties of the above mentioned densities are studied and certain earlier results o ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A method proposed by R. Alexander in his paper published in Acta Arithmetica XII (1967) enables to obtain various densities of set of positive integers, including asymptotic and logarithmic ones. In our paper some properties of the above mentioned densities are studied and certain earlier results
MAXIMAL REPRESENTATIONS OF POSITIVE INTEGERS BY PELL NUMBERS
, 1992
"... In [4], the unique Zeckendorf representations of positive and negative integers by distinct Pell numbers was minimal, i.e., the number of terms in each representational sum was the least possible. Here we show how to represent positive integers maximally by means of Pell numbers. That ..."
Abstract
 Add to MetaCart
In [4], the unique Zeckendorf representations of positive and negative integers by distinct Pell numbers was minimal, i.e., the number of terms in each representational sum was the least possible. Here we show how to represent positive integers maximally by means of Pell numbers. That
The distribution of the number of summands in the partitions of a positive integer
 DUKE MATH . J
, 1941
"... ..."
Partitioning the Positive Integers with Higher Order Recurrences
 Internal J. Math &Math. Sci
"... ABSTRACT. Associated with any irrational number c> and the function g(n) [an +]] is an array {s(i,j)} of positive integers defined inductively as follows: s(1, 1) 1, s(1,j) g(s(1,j 1)) for all j> 2, s(i, 1) the least positive integer not among s(h,j) for h < i for> 2, and s(i,j) g(s(i,j ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ABSTRACT. Associated with any irrational number c> and the function g(n) [an +]] is an array {s(i,j)} of positive integers defined inductively as follows: s(1, 1) 1, s(1,j) g(s(1,j 1)) for all j> 2, s(i, 1) the least positive integer not among s(h,j) for h < i for> 2, and s(i,j) g
Results 11  20
of
8,418