scholarly journals Magic Square and Arrangement of Consecutive Integers That Avoids k-Term Arithmetic Progressions

Mathematics ◽  
2021 ◽  
Vol 9 (18) ◽  
pp. 2259
Author(s):  
Kai An Sim ◽  
Kok Bin Wong
Keyword(s):  
Arithmetic Progression ◽  
Arithmetic Progressions ◽  
Magic Square ◽  
Consecutive Integers

In 1977, Davis et al., proposed a method to generate an arrangement of [n]={1,2,…,n} that avoids three-term monotone arithmetic progressions. Consequently, this arrangement avoids k-term monotone arithmetic progressions in [n] for k≥3. Hence, we are interested in finding an arrangement of [n] that avoids k-term monotone arithmetic progression, but allows k−1-term monotone arithmetic progression. In this paper, we propose a method to rearrange the rows of a magic square of order 2k−3 and show that this arrangement does not contain a k-term monotone arithmetic progression. Consequently, we show that there exists an arrangement of n consecutive integers such that it does not contain a k-term monotone arithmetic progression, but it contains a k−1-term monotone arithmetic progression.

scholarly journals Polynomial values of products of terms from an arithmetic progression

2020 ◽  
Vol 193 (3) ◽  
pp. 637-655
Author(s):  
L. Hajdu ◽  
Á. Papp
Keyword(s):  
Arithmetic Progression ◽  
Arithmetic Progressions ◽  
Consecutive Integers

Abstract Products of terms of arithmetic progressions yielding a perfect power have been long investigated by many mathematicians. In the particular case of consecutive integers, various finiteness results are known for the polynomial values of such products. In the present paper we consider generalizations of these result in various directions.

scholarly journals Arithmetic progressions in finite groups

2021 ◽  
pp. 2250096
Author(s):  
Marius Tărnăuceanu
Keyword(s):  
Arithmetic Progression ◽  
Finite Groups ◽  
Abelian Subgroup ◽  
Proper Subgroup ◽  
Arithmetic Progressions ◽  
Element Orders ◽  
Consecutive Integers

In this paper, we describe the structure of finite groups whose element orders or proper (abelian) subgroup orders form an arithmetic progression of ratio [Formula: see text]. This extends the case [Formula: see text] studied in previous papers [R. Brandl and W. Shi, Finite groups whose element orders are consecutive integers, J. Algebra 143 (1991) 388–400; Y. Feng, Finite groups whose abelian subgroup orders are consecutive integers, J. Math. Res. Exp. 18 (1998) 503–506; W. Shi, Finite groups whose proper subgroup orders are consecutive integers, J. Math. Res. Exp. 14 (1994) 165–166].

A Construction for Partitions Which Avoid Long Arithmetic Progressions

1968 ◽  
Vol 11 (3) ◽  
pp. 409-414 ◽  
Author(s):  
E.R. Berlekamp
Keyword(s):  
Lower Bounds ◽  
Arithmetic Progression ◽  
Arithmetic Progressions ◽  
Consecutive Integers

For k ≥2, t ≥2, let W(k, t) denote the least integer m such that in every partition of m consecutive integers into k sets, atleast one set contains an arithmetic progression of t+1 terms. This paper presents a construction which improves the best previously known lower bounds on W(k, t) for small k and large t.

scholarly journals SUMS OF PRODUCTS OF CONGRUENCE CLASSES AND OF ARITHMETIC PROGRESSIONS

2009 ◽  
Vol 05 (04) ◽  
pp. 625-634
Author(s):  
SERGEI V. KONYAGIN ◽  
MELVYN B. NATHANSON
Keyword(s):  
Arithmetic Progression ◽  
Congruence Class ◽  
Arithmetic Progressions ◽  
Sum Of Products ◽  
Sums Of Products ◽  
Positive Integers ◽  
Congruence Classes

Consider the congruence class Rm(a) = {a + im : i ∈ Z} and the infinite arithmetic progression Pm(a) = {a + im : i ∈ N0}. For positive integers a,b,c,d,m the sum of products set Rm(a)Rm(b) + Rm(c)Rm(d) consists of all integers of the form (a+im) · (b+jm)+(c+km)(d+ℓm) for some i,j,k,ℓ ∈ Z. It is proved that if gcd (a,b,c,d,m) = 1, then Rm(a)Rm(b) + Rm(c)Rm(d) is equal to the congruence class Rm(ab+cd), and that the sum of products set Pm(a)Pm(b)+Pm(c)Pm eventually coincides with the infinite arithmetic progression Pm(ab+cd).

scholarly journals Obtaining Easily Sums of Powers on Arithmetic Progressions and Properties of Bernoulli Polynomials by Operator Calculus

2017 ◽  
Vol 9 (5) ◽  
pp. 73
Author(s):  
Do Tan Si
Keyword(s):  
Differential Operator ◽  
Generating Function ◽  
Arithmetic Progression ◽  
Bernoulli Polynomials ◽  
Bernoulli Numbers ◽  
Arithmetic Progressions ◽  
Operator Calculus ◽  
Sums Of Powers ◽  
The Way

We show that a sum of powers on an arithmetic progression is the transform of a monomial by a differential operator and that its generating function is simply related to that of the Bernoulli polynomials from which consequently it may be calculated. Besides, we show that it is obtainable also from the sums of powers of integers, i.e. from the Bernoulli numbers which in turn may be calculated by a simple algorithm.By the way, for didactic purpose, operator calculus is utilized for proving in a concise manner the main properties of the Bernoulli polynomials. 

scholarly journals ON THE DENSITY OF INTEGERS OF THE FORM (p−1)2−n IN ARITHMETIC PROGRESSIONS

2008 ◽  
Vol 78 (3) ◽  
pp. 431-436 ◽  
Author(s):  
XUE-GONG SUN ◽  
JIN-HUI FANG
Keyword(s):  
Positive Integer ◽  
Prime Number ◽  
Arithmetic Progression ◽  
Arithmetic Progressions ◽  
Asymptotic Density ◽  
Natural Numbers ◽  
Positive Proportion ◽  
Covering System

AbstractErdős and Odlyzko proved that odd integers k such that k2n+1 is prime for some positive integer n have a positive lower density. In this paper, we characterize all arithmetic progressions in which natural numbers that can be expressed in the form (p−1)2−n (where p is a prime number) have a positive proportion. We also prove that an arithmetic progression consisting of odd numbers can be obtained from a covering system if and only if those integers in such a progression which can be expressed in the form (p−1)2−n have an asymptotic density of zero.

scholarly journals Monochromatic arithmetic progressions with large differences

1999 ◽  
Vol 60 (1) ◽  
pp. 21-35
Author(s):  
Tom C. Brown ◽  
Bruce M. Landman
Keyword(s):  
Positive Integer ◽  
Lower Bounds ◽  
Arithmetic Progression ◽  
Constant Function ◽  
Arithmetic Progressions ◽  
Upper And Lower Bounds

A generalisation of the van der Waerden numbers w(k, r) is considered. For a function f: Z+ → R+ define w(f, k, r) to be the least positive integer (if it exists) such that for every r-coloring of [1, w(f, k, r)] there is a monochromatic arithmetic progression {a + id: 0 ≤ i ≤ k −1} such that d ≥ f(a). Upper and lower bounds are given for w(f, 3, 2). For k > 3 or r > 2, particular functions f are given such that w(f, k, r) does not exist. More results are obtained for the case in which f is a constant function.

scholarly journals The Faulhaber Problem on Sums of Powers on Arithmetic Progressions Resolved

2018 ◽  
Vol 10 (2) ◽  
pp. 5
Author(s):  
Do Tan Si
Keyword(s):  
Arithmetic Progression ◽  
Bernoulli Polynomials ◽  
Arithmetic Progressions ◽  
Power Sums ◽  
Sums Of Powers

We prove that all the Faulhaber coefficients of a sum of odd power of elements of an arithmetic progression may simply be calculated from only one of them which is easily calculable from two Bernoulli polynomials as so as from power sums of integers. This gives two simple formulae for calculating them. As for sums related to even powers, they may be calculated simply from those related to the nearest odd one’s.

scholarly journals NONZERO VALUES OF DIRICHLET L-FUNCTIONS IN VERTICAL ARITHMETIC PROGRESSIONS

2013 ◽  
Vol 09 (04) ◽  
pp. 813-843 ◽  
Author(s):  
GREG MARTIN ◽  
NATHAN NG
Keyword(s):  
Arithmetic Progression ◽  
Positive Constant ◽  
Upper Bound ◽  
Arithmetic Progressions ◽  
Linearly Independent ◽  
Theoretical Evidence

Let L(s, χ) be a fixed Dirichlet L-function. Given a vertical arithmetic progression of T points on the line ℜs = ½, we show that at least cT/ log T of them are not zeros of L(s, χ) (for some positive constant c). This result provides some theoretical evidence towards the conjecture that all nonnegative ordinates of zeros of Dirichlet L-functions are linearly independent over the rationals. We also establish an upper bound (depending upon the progression) for the first member of the arithmetic progression that is not a zero of L(s, χ).

scholarly journals Sets of Integers that do not Contain Long Arithmetic Progressions

10.37236/546 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Kevin O'Bryant
Keyword(s):  
Lower Bounds ◽  
Arithmetic Progression ◽  
Arithmetic Progressions

Combining ideas of Rankin, Elkin, Green & Wolf, we give constructive lower bounds for $r_k(N)$, the largest size of a subset of $\{1,2,\dots,N\}$ that does not contain a $k$-element arithmetic progression: For every $\epsilon>0$, if $N$ is sufficiently large, then $$r_3(N) \geq N \left(\frac{6\cdot 2^{3/4} \sqrt{5}}{e \,\pi^{3/2}}-\epsilon\right) \exp\left({-\sqrt{8\log N}+\tfrac14\log\log N}\right),$$ $$r_k(N) \geq N \, C_k\,\exp\left({-n 2^{(n-1)/2} \sqrt[n]{\log N}+\tfrac{1}{2n}\log\log N}\right),$$ where $C_k>0$ is an unspecified constant, $\log=\log_2$, $\exp(x)=2^x$, and $n=\lceil{\log k}\rceil$. These are currently the best lower bounds for all $k$, and are an improvement over previous lower bounds for all $k\neq4$.

Sign in / Sign up

Export Citation Format

Share Document