Page 1 Next

Displaying 1 – 20 of 281

Showing per page

A contribution to infinite disjoint covering systems

János Barát, Péter P. Varjú (2005)

Journal de Théorie des Nombres de Bordeaux

Let the collection of arithmetic sequences { d i n + b i : n } i I be a disjoint covering system of the integers. We prove that if d i = p k q l for some primes p , q and integers k , l 0 , then there is a j i such that d i | d j . We conjecture that the divisibility result holds for all moduli.A disjoint covering system is called saturated if the sum of the reciprocals of the moduli is equal to 1 . The above conjecture holds for saturated systems with d i such that the product of its prime factors is at most 1254 .

A generalization of Pascal’s triangle using powers of base numbers

Gábor Kallós (2006)

Annales mathématiques Blaise Pascal

In this paper we generalize the Pascal triangle and examine the connections among the generalized triangles and powering integers respectively polynomials. We emphasize the relationship between the new triangles and the Pascal pyramids, moreover we present connections with the binomial and multinomial theorems.

A note on minimal zero-sum sequences over ℤ

Papa A. Sissokho (2014)

Acta Arithmetica

A zero-sum sequence over ℤ is a sequence with terms in ℤ that sum to 0. It is called minimal if it does not contain a proper zero-sum subsequence. Consider a minimal zero-sum sequence over ℤ with positive terms a , . . . , a h and negative terms b , . . . , b k . We prove that h ≤ ⌊σ⁺/k⌋ and k ≤ ⌊σ⁺/h⌋, where σ = i = 1 h a i = - j = 1 k b j . These bounds are tight and improve upon previous results. We also show a natural partial order structure on the collection of all minimal zero-sum sequences over the set i∈ ℤ : -n ≤ i ≤ n for any positive integer n.

A problem of Rankin on sets without geometric progressions

Melvyn B. Nathanson, Kevin O'Bryant (2015)

Acta Arithmetica

A geometric progression of length k and integer ratio is a set of numbers of the form a , a r , . . . , a r k - 1 for some positive real number a and integer r ≥ 2. For each integer k ≥ 3, a greedy algorithm is used to construct a strictly decreasing sequence ( a i ) i = 1 of positive real numbers with a₁ = 1 such that the set G ( k ) = i = 1 ( a 2 i , a 2 i - 1 ] contains no geometric progression of length k and integer ratio. Moreover, G ( k ) is a maximal subset of (0,1] that contains no geometric progression of length k and integer ratio. It is also proved that there is...

Currently displaying 1 – 20 of 281

Page 1 Next