Linear Equations with Small Prime and Almost Prime Solutions

2008 ◽  
Vol 51 (3) ◽  
pp. 399-405
Author(s):  
Xianmeng Meng
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Linear Equations ◽  
Prime Factors ◽  
Almost All ◽  
Sharp Lower Bound ◽  
Almost Prime

AbstractLet b1, b2 be any integers such that gcd(b1, b2) = 1 and c1|b1| < |b2| ≤ c2|b1|, where c1, c2 are any given positive constants. Let n be any integer satisfying gcd(n, bi) = 1, i = 1, 2. Let Pk denote any integer with no more than k prime factors, counted according to multiplicity. In this paper, for almost all b2, we prove (i) a sharp lower bound for n such that the equation b1p + b2m = n is solvable in prime p and almost prime m = Pk, k ≥ 3 whenever both bi are positive, and (ii) a sharp upper bound for the least solutions p, m of the above equation whenever bi are not of the same sign, where p is a prime and m = Pk, k ≥ 3.

Extremal multiplicative Zagreb indices among trees with given distance k-domination number

2020 ◽  
pp. 2150087
Author(s):  
Fazal Hayat
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Domination Number ◽  
Vertex Degree ◽  
Index Formula ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
Sharp Lower Bound ◽  
Distance Formula

The first multiplicative Zagreb index [Formula: see text] of a graph [Formula: see text] is the product of the square of every vertex degree, while the second multiplicative Zagreb index [Formula: see text] is the product of the products of degrees of pairs of adjacent vertices. In this paper, we give sharp lower bound for [Formula: see text] and upper bound for [Formula: see text] of trees with given distance [Formula: see text]-domination number, and characterize those trees attaining the bounds.

scholarly journals Iterative estimation of total π-electron energy

2005 ◽  
Vol 70 (10) ◽  
pp. 1193-1197 ◽  
Author(s):  
Lemi Türker ◽  
Ivan Gutman
Keyword(s):  
Lower Bound ◽  
Electron Energy ◽  
Upper Bound ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Benzenoid Hydrocarbons ◽  
Total Electron ◽  
Iterative Estimation ◽  
Total Electron Energy ◽  
Almost All

In this work, the lower and upper bounds for total ?-electron energy (E) was studied. A method is presented, by means of which, starting with a lower bound EL and an upper bound EU for E, a sequence of auxiliary quantities E0 E1, E2,? is computed, such that E0 = EL, E0 < E1 < E2 < ?, and E = EU. Therefore, an integer k exists, such that Ek E < Ek+1. If the estimates EL and EU are of the McClelland type, then k is called the McClelland number. For almost all benzenoid hydrocarbons, k = 3.

Supremum and infimum of subharmonic functions of order between 1 and 2

2011 ◽  
Vol 54 (3) ◽  
pp. 685-693
Author(s):  
P. C. Fenton
Keyword(s):  
Lower Bound ◽  
Convex Function ◽  
Upper Bound ◽  
Counting Function ◽  
Subharmonic Functions ◽  
Image Position ◽  
Sharp Lower Bound

AbstractFor functions u, subharmonic in the plane, letand let N(r,u) be the integrated counting function. Suppose that $\mathcal{N}\colon[0,\infty)\rightarrow\mathbb{R}$ is a non-negative non-decreasing convex function of log r for which $\mathcal{N}(r)=0$ for all small r and $\limsup_{r\to\infty}\log\mathcal{N}(r)/\4\log r=\rho$, where 1 < ρ < 2, and defineA sharp upper bound is obtained for $\liminf_{r\to\infty}\mathcal{B}(r,\mathcal{N})/\mathcal{N}(r)$ and a sharp lower bound is obtained for $\limsup_{r\to\infty}\mathcal{A}(r,\mathcal{N})/\mathcal{N}(r)$.

scholarly journals Total Graph Interpretation of the Numbers of the Fibonacci Type

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Urszula Bednarz ◽  
Iwona Włoch ◽  
Małgorzata Wołowiec-Musiał
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Total Graph ◽  
Graph Interpretation ◽  
Edge Colourings ◽  
Almost All ◽  
Edge Colouring

We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation relates to an edge colouring by monochromatic paths in graphs. We will show that it works for almost all numbers of the Fibonacci type. Moreover, we give the lower bound and the upper bound for the number of all(A1,2A1)-edge colourings in trees.

Lower Bounds for Matrices, II

1991 ◽  
Vol 44 (1) ◽  
pp. 54-74 ◽  
Author(s):  
Grahame Bennett
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Upper Bound ◽  
Monotonicity Property ◽  
Hausdorff Matrix ◽  
Increasing Function ◽  
Sharp Lower Bound

AbstractOur main result is the following monotonicity property for moment sequences μ. Let p be fixed, 1 ≤ p < ∞: thenis an increasing function of r(r = 1,2,…). From this we derive a sharp lower bound for an arbitrary Hausdorff matrix acting on ℓp.The corresponding upper bound problem was solved by Hardy.

The least distance between extremums and minimal period of solutions to autonomous vector differential equations

2019 ◽  
Vol 485 (2) ◽  
pp. 142-144
Author(s):  
A. A. Zevin
Keyword(s):  
Lower Bound ◽  
Differential Equations ◽  
Periodic Solutions ◽  
Lipschitz Constant ◽  
Minimal Period ◽  
Arbitrary Vector ◽  
Vector Norm ◽  
Sharp Lower Bound

Solutions x(t) of the Lipschitz equation x = f(x) with an arbitrary vector norm are considered. It is proved that the sharp lower bound for the distances between successive extremums of xk(t) equals π/L where L is the Lipschitz constant. For non-constant periodic solutions, the lower bound for the periods is 2π/L. These estimates are achieved for norms that are invariant with respect to permutation of the indices.

scholarly journals Compactness and Sharp Lower Bound for a 2D Smectics Model

2021 ◽  
Vol 31 (3) ◽  
Author(s):  
Michael Novack ◽  
Xiaodong Yan
Keyword(s):  
Lower Bound ◽  
Sharp Lower Bound

Success probabilities for second guessers

1980 ◽  
Vol 17 (04) ◽  
pp. 1133-1137 ◽  
Author(s):  
A. O. Pittenger
Keyword(s):  
Lower Bound ◽  
Dimensional Space ◽  
Success Probability ◽  
First Person ◽  
True Location ◽  
Rotationally Symmetric ◽  
The One ◽  
Sharp Lower Bound

Two people independently and with the same distribution guess the location of an unseen object in n-dimensional space, and the one whose guess is closer to the unseen object is declared the winner. The first person announces his guess, but the second modifies his unspoken idea by moving his guess in the direction of the first guess and as close to it as possible. It is shown that if the distribution of guesses is rotationally symmetric about the true location of the unseen object, ¾ is the sharp lower bound for the success probability of the second guesser. If the distribution is fixed and the dimension increases, then for a certain class of distributions, the success probability approaches 1.

Sign in / Sign up

Export Citation Format

Share Document