#### Filter Results:

#### Publication Year

2001

2011

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Given a set of positive integers A = {a 1 ,. .. , a n }, we study the number p A (t) of nonnegative integer solutions (m 1 ,. .. , m n) to n j=1 m j a j = t. We derive an explicit formula for the polynomial part of p A. Let A = {a 1 ,. .. , a n } be a set of positive integers with gcd(a 1 ,. .. , a n) = 1. The classical Frobenius problem asks for the… (More)

In this paper we consider infinite sums derived from the reciprocals of the Fibonacci numbers, and infinite sums derived from the reciprocals of the square of the Fibonacci numbers. Applying the floor function to the reciprocals of these sums, we obtain equalities that involve the Fibonacci numbers.

We discuss the partial infinite sum ∞ k=n u −s k for some positive integer n, where u k satisfies a recurrence relation of order s, u n = au n−1 + u n−2 + · · · + u n−s (n ≥ s), with initial values u 0 ≥ 0, u k ∈ N (0 ≤ k ≤ s − 1), where a and s(≥ 2) are positive integers. If a = 1, s = 2, and u 0 = 0, u 1 = 1, then u k = F k is the k-th Fibonacci number.… (More)

For any given real number, its corresponding continued fraction is unique. However, given an arbitrary continued fraction, there has been no general way to identify its corresponding real number. In this paper we shall show a general algorithm from continued fractions to real numbers via infinite sums representations. Using this algorithm, we obtain some… (More)

- ‹
- 1
- ›