scholarly journals Minimum Number of Colours to Avoid k-Term Monochromatic Arithmetic Progressions

Mathematics ◽  
2022 ◽  
Vol 10 (2) ◽  
pp. 247
Author(s):  
Kai An Sim ◽  
Kok Bin Wong
Keyword(s):  
Positive Integer ◽  
Arithmetic Progression ◽  
Upper Bound ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Arithmetic Progressions ◽  
Minimum Number ◽  
Necessary And Sufficient

By recalling van der Waerden theorem, there exists a least a positive integer w=w(k;r) such that for any n≥w, every r-colouring of [1,n] admits a monochromatic k-term arithmetic progression. Let k≥2 and rk(n) denote the minimum number of colour required so that there exists a rk(n)-colouring of [1,n] that avoids any monochromatic k-term arithmetic progression. In this paper, we give necessary and sufficient conditions for rk(n+1)=rk(n). We also show that rk(n)=2 for all k≤n≤2(k−1)2 and give an upper bound for rp(pm) for any prime p≥3 and integer m≥2.

On Sums of Progressions of Positive Integers

1970 ◽  
Vol 54 (388) ◽  
pp. 113-115
Author(s):  
R. L. Goodstein
Keyword(s):  
Positive Integer ◽  
Arithmetic Progression ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
The Common ◽  
Necessary And Sufficient ◽  
Positive Integers

We consider the problem of finding necessary and sufficient conditions for a positive integer to be the sum of an arithmetic progression of positive integers with a given common difference, starting with the case when the common difference is unity.

scholarly journals Characterizations and Identities for Isosceles Triangular Numbers

2021 ◽  
Vol 14 (2) ◽  
pp. 380-395
Author(s):  
Jiramate Punpim ◽  
Somphong Jitman
Keyword(s):  
Positive Integer ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Triangular Numbers ◽  
Triangular Number ◽  
Recursive Formulas ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Special Case

Triangular numbers have been of interest and continuously studied due to their beautiful representations, nice properties, and various links with other figurate numbers. For positive integers n and l, the nth l-isosceles triangular number is a generalization of triangular numbers defined to be the arithmetic sum of the formT(n, l) = 1 + (1 + l) + (1 + 2l) + · · · + (1 + (n − 1)l).In this paper, we focus on characterizations and identities for isosceles triangular numbers as well as their links with other figurate numbers. Recursive formulas for constructions of isosceles triangular numbers are given together with necessary and sufficient conditions for a positive integer to be a sum of isosceles triangular  numbers. Various identities for isosceles triangular numbers are established. Results on triangular numbers can be viewed as a special case.

scholarly journals A strict upper bound for size multipartite Ramsey numbers of paths versus stars

2017 ◽  
Vol 1 (2) ◽  
pp. 9
Author(s):  
Chula Jayawardene
Keyword(s):  
Natural Number ◽  
Complete Graph ◽  
Upper Bound ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Infinite Class ◽  
Ramsey Numbers ◽  
Necessary And Sufficient

<p>Let $P_n$ represent the path of size $n$. Let $K_{1,m-1}$ represent a star of size $m$ and be denoted by $S_{m}$. Given a two coloring of the edges of a complete graph $K_{j \times s}$ we say that $K_{j \times s}\rightarrow (P_n,S_{m+1})$ if there is a copy of $P_n$ in the first color or a copy of $S_{m+1}$ in the second color. The size Ramsey multipartite number $m_j(P_n, S_{m+1})$ is the smallest natural number $s$ such that $K_{j \times s}\rightarrow (P_n,S_{m+1})$. Given $j,n,m$ if $s=\left\lceil \dfrac{n+m-1-k}{j-1} \right\rceil$, in this paper, we show that the size Ramsey numbers $m_j(P_n,S_{m+1})$ is bounded above by $s$ for $k=\left\lceil \dfrac{n-1}{j} \right\rceil$. Given $j\ge 3$ and $s$, we will obtain an infinite class $(n,m)$ that achieves this upper bound $s$. In the later part of the paper, will also investigate necessary and sufficient conditions needed for the upper bound to hold.</p>

scholarly journals On Generalizations of phi-2-Absorbing Primary Submodules

2018 ◽  
Vol 11 (1) ◽  
pp. 35
Author(s):  
Pairote Yiarayong ◽  
Manoj Siripitukdet
Keyword(s):  
Positive Integer ◽  
Sufficient Conditions ◽  
Commutative Rings ◽  
Necessary And Sufficient Conditions ◽  
Primary Submodules ◽  
Primary Submodule ◽  
Necessary And Sufficient

Let $\phi: S(M) \rightarrow S(M) \cup \left\lbrace \emptyset\right\rbrace $ be a function where $S(M)$ is the set of all submodules of $M$. In this paper, we extend the concept of $\phi$-$2$-absorbing primary submodules to the context of $\phi$-$2$-absorbing semi-primary submodules. A proper submodule $N$ of $M$ is called a $\phi$-$2$-absorbing semi-primary submodule, if for each $m \in M$ and $a_{1}, a_{2}\in R$ with $a_{1}a_{2}m \in N - \phi(N)$, then $a_{1}a_{2}\in \sqrt{(N : M)}$ or  $a_{1}m \in N$ or $a^{n}_{2}m\in N$, for some positive integer $n$. Those are extended from $2$-absorbing primary, weakly $2$-absorbing primary, almost $2$-absorbing primary, $\phi_{n}$-$2$-absorbing primary, $\omega$-$2$-absorbing primary and $\phi$-$2$-absorbing primary submodules, respectively. Some characterizations of $2$-absorbing semi-primary, $\phi_{n}$-$2$-absorbing semi-primary and $\phi$-$2$-absorbing semi-primary submodules are obtained. Moreover, we investigate relationships between $2$-absorbing semi-primary, $\phi_{n}$-$2$-absorbing semi-primary and $\phi$-primary submodules of modules over commutative rings. Finally, we obtain necessary and sufficient conditions of a $\phi$-$\phi$-$2$-absorbing semi-primary in order to be a $\phi$-$2$-absorbing semi-primary.

scholarly journals Eventually Pointed Principally Ordered Regular Semigroups

2020 ◽  
Vol 24 (2) ◽  
pp. 139
Author(s):  
G.A. Pinto
Keyword(s):  
Positive Integer ◽  
Regular Semigroup ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Regular Semigroups ◽  
Necessary And Sufficient ◽  
Completely Simple

An ordered regular semigroup, , is said to be principally ordered if for every  there exists . A principally ordered regular semigroup is pointed if for every element,  we have . Here we investigate those principally ordered regular semigroups that are eventually pointed in the sense that for all  there exists a positive integer, , such that . Necessary and sufficient conditions for an eventually pointed principally ordered regular semigroup to be naturally ordered and to be completely simple are obtained. We describe the subalgebra of  generated by a pair of comparable idempotents  and such that . 

On a Theorem of Rav Concerning Egyptian Fractions

1975 ◽  
Vol 18 (1) ◽  
pp. 155-156 ◽  
Author(s):  
William A. Webb
Keyword(s):  
Positive Integer ◽  
Elementary Proof ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Egyptian Fractions ◽  
Image Position ◽  
Complete Bibliography ◽  
Necessary And Sufficient

Problems involving Egyptian fractions (rationals whose numerator is 1 and whose denominator is a positive integer) have been extensively studied. (See [1] for a more complete bibliography). Some of the most interesting questions, many still unsolved, concern the solvability ofwhere k is fixed.In [2] Rav proved necessary and sufficient conditions for the solvabilty of the above equation, as a consequence of some other theorems which are rather complicated in their proofs. In this note we give a short, elementary proof of this theorem, and at the same time generalize it slightly.

scholarly journals On the number of Kekulé structures of fluoranthene congeners

2010 ◽  
Vol 75 (8) ◽  
pp. 1093-1098 ◽  
Author(s):  
Damir Vukicevic ◽  
Jelena Djurdjevic ◽  
Ivan Gutman
Keyword(s):  
Positive Integer ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Electron Systems ◽  
Kekulé Structures ◽  
Male And Female ◽  
Structure Count ◽  
Necessary And Sufficient

The Kekul? structure count K of fluoranthene congeners is studied. It is shown that for such polycyclic conjugated ?-electron systems, either K = 0 or K ? 3. Moreover, for every t ? 3, there are infinitely many fluoranthene congeners having exactly t Kekul? structures. Three classes of Kekul?an fluoranthenes are distinguished: (i) ?0 - fluoranthene congeners in which neither the male nor the female benzenoid fragment has Kekul? structures, (ii) ?m - fluoranthene congeners in which the male benzenoid fragment has Kekul? structures, but the female does not, and (iii) ?fm - fluoranthene congeners in which both the male and female benzenoid fragments have Kekul? structures. Necessary and sufficient conditions are established for each class, ? = ?0, ?m, ?fm, such that for a given positive integer t, there exist fluoranthene congeners in ? with the property K = t.

A Network-Flow Feasibility Theorem and Combinatorial Applications

1959 ◽  
Vol 11 ◽  
pp. 440-451 ◽  
Author(s):  
D. R. Fulkerson
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Network Flow ◽  
Present Author ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Private Communication ◽  
Circulatory Flow ◽  
Necessary And Sufficient ◽  
Circulation Theorem

There are a number of interesting theorems, relative to capacitated networks, that give necessary and sufficient conditions for the existence of flows satisfying constraints of various kinds. Typical of these are the supply-demand theorem due to Gale (4), which states a condition for the existence of a flow satisfying demands at certain nodes from supplies at other nodes, and the Hoffman circulation theorem (received by the present author in private communication), which states a condition for the existence of a circulatory flow in a network in which each arc has associated with it not only an upper bound for the arc flow, but a lower bound as well. If the constraints on flows are integral (for example, if the bounds on arc flows for the circulation theorem are integers), it is also true that integral flows meeting the requirements exist provided any flow does so.

scholarly journals On powerful numbers

1986 ◽  
Vol 9 (4) ◽  
pp. 801-806 ◽  
Author(s):  
R. A. Mollin ◽  
P. G. Walsh
Keyword(s):  
Positive Integer ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Effective Algorithm ◽  
Existence Proof ◽  
Prime Decomposition ◽  
Open Questions ◽  
Necessary And Sufficient ◽  
Powerful Numbers

A powerful number is a positive integernsatisfying the property thatp2dividesnwhenever the primepdividesn; i.e., in the canonical prime decomposition ofn, no prime appears with exponent 1. In [1], S.W. Golomb introduced and studied such numbers. In particular, he asked whether(25,27)is the only pair of consecutive odd powerful numbers. This question was settled in [2] by W.A. Sentance who gave necessary and sufficient conditions for the existence of such pairs. The first result of this paper is to provide a generalization of Sentance's result by giving necessary and sufficient conditions for the existence of pairs of powerful numbers spaced evenly apart. This result leads us naturally to consider integers which are representable as a proper difference of two powerful numbers, i.e.n=p1−p2wherep1andp2are powerful numbers with g.c.d.(p1,p2)=1. Golomb (op.cit.) conjectured that6is not a proper difference of two powerful numbers, and that there are infinitely many numbers which cannot be represented as a proper difference of two powerful numbers. The antithesis of this conjecture was proved by W.L. McDaniel [3] who verified that every non-zero integer is in fact a proper difference of two powerful numbers in infinitely many ways. McDaniel's proof is essentially an existence proof. The second result of this paper is a simpler proof of McDaniel's result as well as an effective algorithm (in the proof) for explicitly determining infinitely many such representations. However, in both our proof and McDaniel's proof one of the powerful numbers is almost always a perfect square (namely one is always a perfect square whenn≢2(mod4)). We provide in §2 a proof that all even integers are representable in infinitely many ways as a proper nonsquare difference; i.e., proper difference of two powerful numbers neither of which is a perfect square. This, in conjunction with the odd case in [4], shows that every integer is representable in infinitely many ways as a proper nonsquare difference. Moreover, in §2 we present some miscellaneous results and conclude with a discussion of some open questions.

scholarly journals Regular formal modules in local fields and irregularly degree

2020 ◽  
Vol 65 (4) ◽  
pp. 588-596
Author(s):  
Natalya K. Vlaskina ◽  
◽  
Sergei V. Vostokov ◽  
Petr N. Pital’ ◽  
Aleksey E. Tsybyshiev ◽  
...  
Keyword(s):  
Positive Integer ◽  
Local Field ◽  
Sufficient Conditions ◽  
Formal Group ◽  
Necessary And Sufficient Conditions ◽  
Local Fields ◽  
Ramification Index ◽  
Necessary And Sufficient ◽  
Primitive Roots

In this paper we investigate the irregular degree of finite not ramified local field extantions with respect to a polynomial formal group and in the multiplicative case. There was found necessary and sufficient conditions for the existence of primitive roots of ps power from 1 and (endomorphism [ps]Fm) in L-th unramified extension of the local field K (for all positive integer s). These conditions depend only on the ramification index of the maximal abelian subextension of the field K Ka/Qp.

Sign in / Sign up

Export Citation Format

Share Document