scholarly journals On sums of monotone functions over smooth numbers

2021 ◽  
Vol 13 (1) ◽  
pp. 273-280
Author(s):  
Gábor Román
Keyword(s):  
Positive Integer ◽  
Prime Factor ◽  
Monotone Function ◽  
Monotone Functions ◽  
Natural Numbers ◽  
Smooth Numbers ◽  
Dickman Function

Abstract In this article, we are going to look at the requirements regarding a monotone function f ∈ ℝ →ℝ ≥0, and regarding the sets of natural numbers ( A i ) i = 1 ∞ ⊆ d m n ( f ) \left( {{A_i}} \right)_{i = 1}^\infty \subseteq dmn\left( f \right) , which requirements are sufficient for the asymptotic ∑ n ∈ A N P ( n ) ≤ N θ f ( n ) ∼ ρ ( 1 / θ ) ∑ n ∈ A N f ( n ) \sum\limits_{\matrix{{n \in {A_N}} \hfill \cr {P\left( n \right) \le {N^\theta }} \hfill \cr } } {f\left( n \right) \sim \rho \left( {1/\theta } \right)\sum\limits_{n \in {A_N}} {f\left( n \right)} } to hold, where N is a positive integer, θ ∈ (0, 1) is a constant, P(n) denotes the largest prime factor of n, and ρ is the Dickman function.

scholarly journals On Waring’s problem: Three cubes and a sixth power

2001 ◽  
Vol 163 ◽  
pp. 13-53 ◽  
Author(s):  
Jörg Brüdern ◽  
Trevor D. Wooley
Keyword(s):  
Exponential Sums ◽  
Large Integer ◽  
Natural Numbers ◽  
Waring’S Problem ◽  
Smooth Numbers ◽  
Waring's Problem ◽  
Order Of Magnitude ◽  
Almost All ◽  
Hardy Littlewood Method

We establish that almost all natural numbers not congruent to 5 modulo 9 are the sum of three cubes and a sixth power of natural numbers, and show, moreover, that the number of such representations is almost always of the expected order of magnitude. As a corollary, the number of representations of a large integer as the sum of six cubes and two sixth powers has the expected order of magnitude. Our results depend on a certain seventh moment of cubic Weyl sums restricted to minor arcs, the latest developments in the theory of exponential sums over smooth numbers, and recent technology for controlling the major arcs in the Hardy-Littlewood method, together with the use of a novel quasi-smooth set of integers.

Some comments on inverse arithmetic functions

2004 ◽  
Vol 89 (516) ◽  
pp. 403-408
Author(s):  
P. G. Brown
Keyword(s):  
Number Theory ◽  
Prime Factor ◽  
Arithmetic Functions ◽  
Natural Numbers ◽  
Finite Mathematics ◽  
Factor Decomposition

In many of the basic courses in Number Theory, Finite Mathematics and Cryptography we come across the so-called arithmetic functions such as ϕn), σ(n), τ(n), μ(n), etc, whose domain is the set of natural numbers. These functions are well known and evaluated through the prime factor decomposition of n. It is less well known that these functions possess inverses (with respect to Dirichlet multiplication) which have interesting properties and applications.

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 Square-full numbers in short intervals

1991 ◽  
Vol 110 (1) ◽  
pp. 1-3 ◽  
Author(s):  
D. R. Heath-Brown
Keyword(s):  
Positive Integer ◽  
Riemann Hypothesis ◽  
Prime Factor ◽  
Short Interval ◽  
Short Intervals ◽  
Image Position

A positive integer n is called square-full if p2|n for every prime factor p of n. Let Q(x) denote the number of square-full integers up to x. It was shown by Bateman and Grosswald [1] thatBateman and Grosswald also remarked that any improvement in the exponent would imply a ‘quasi-Riemann Hypothesis’ of the type for . Thus (1) is essentially as sharp as one can hope for at present. From (1) it follows that, for the number of square-full integers in a short interval, we havewhen and y = o (x½). (It seems more suggestive) to write the interval as (x, x + x½y]) than (x, x + y], since only intervals of length x½ or more can be of relevance here.)

scholarly journals A nonlinear complementarity problem for monotone functions

1979 ◽  
Vol 20 (2) ◽  
pp. 227-231 ◽  
Author(s):  
Sribatsa Nanda ◽  
Ujagar Patel
Keyword(s):  
Unique Solution ◽  
Complementarity Problem ◽  
Monotone Function ◽  
Nonlinear Complementarity Problem ◽  
Monotone Functions ◽  
Nonlinear Complementarity

In this note we prove that for a monotone function that fixes the origin, the complementarity problem for Cn always admits a solution. If, moreover, the function is strictly monotone, then zero is the unique solution. These results are stronger than known results in this direction for two reasons: firstly, there is no condition on the nature of the cone and secondly, no feasibility assumptions are made.

scholarly journals Evaluation of the convolution sum involving the sum of divisors function for 22, 44 and 52

2017 ◽  
Vol 15 (1) ◽  
pp. 446-458 ◽  
Author(s):  
Ebénézer Ntienjem
Keyword(s):  
Positive Integer ◽  
Modular Forms ◽  
Quadratic Forms ◽  
Modular Space ◽  
Natural Numbers ◽  
Convolution Sums ◽  
Sum Of Divisors

Abstract The convolution sum, $ \begin{array}{} \sum\limits_{{(l\, ,m)\in \mathbb{N}_{0}^{2}}\atop{\alpha \,l+\beta\, m=n}} \sigma(l)\sigma(m), \end{array} $ where αβ = 22, 44, 52, is evaluated for all natural numbers n. Modular forms are used to achieve these evaluations. Since the modular space of level 22 is contained in that of level 44, we almost completely use the basis elements of the modular space of level 44 to carry out the evaluation of the convolution sums for αβ = 22. We then use these convolution sums to determine formulae for the number of representations of a positive integer by the octonary quadratic forms $a\,(x_{1}^{2}+x_{2}^{2}+x_{3}^{2}+x_{4}^{2})+b\,(x_{5}^{2}+x_{6}^{2}+x_{7}^{2}+x_{8}^{2}),$ where (a, b) = (1, 11), (1, 13).

scholarly journals On the Diophantine equationx3=dy2±q6

2001 ◽  
Vol 28 (8) ◽  
pp. 493-497 ◽  
Author(s):  
Fadwa S. Abu Muriefah
Keyword(s):  
Positive Integer ◽  
Prime Factor

Letq>3denote an odd prime andda positive integer without any prime factorp≡1(mod3). In this paper, we have proved that if(x,q)=1, thenx3=dy2±q6has exactly two solutions providedq≢±1(mod24).

scholarly journals On sparsely totient numbers

1991 ◽  
Vol 33 (3) ◽  
pp. 350-358
Author(s):  
Glyn Harman
Keyword(s):  
Positive Integer ◽  
Prime Factor ◽  
Multiplicative Structure ◽  
Euler Totient Function ◽  
Image Position

Following Masser and Shiu [6] we say that a positive integer n is sparsely totient ifHere φ is the familiar Euler totient function. We write ℱ for the set of sparsely totient numbers. In [6] several results are proved about the multiplicative structure of ℱ. If we write P(n) for the largest prime factor of n then it was shown (Theorem 2 of [6]) thatand infinitely often

Independent Gödel sentences and independent sets

1975 ◽  
Vol 40 (2) ◽  
pp. 159-166
Author(s):  
A. M. Dawes ◽  
J. B. Florence
Keyword(s):  
Positive Integer ◽  
Independent Sets ◽  
Peano Arithmetic ◽  
Natural Numbers ◽  
Simple Set ◽  
Logical Notion ◽  
Infinite Set ◽  
Element Set

In this paper we investigate some of the recursion-theoretic problems which are suggested by the logical notion of independence.A set S of natural numbers will be said to be k-independent (respectively, ∞-independent) if, roughly speaking, in every correct system there is a k-element set (respectively, an infinite set) of independent true sentences of the form x ∈ S. S will be said to be effectively independent (respectively, absolutely independent) if given any correct system we can generate an infinite set of independent (respectively, absolutely independent) true sentences of the form x ∈ S.We prove that(a) S is absolutely independent ⇔S is effectively independent ⇔S is productive;(b) for every positive integer k there is a Π1 set which is k-independent but not (k + 1)-independent;(c) there is a Π1 set which is k-independent for all k but not ∞-independent;(d) there is a co-simple set which is ∞-independent.We also give two new proofs of the theorem of Myhill [1] on the existence of an infinite set of Σ1 sentences which are absolutely independent relative to Peano arithmetic. The first proof uses the existence of an absolutely independent Π1 set of natural numbers, and the second uses a modification of the method of Gödel and Rosser.

Theories incomparable with respect to relative interpretability

1962 ◽  
Vol 27 (2) ◽  
pp. 195-211 ◽  
Author(s):  
Richard Montague
Keyword(s):  
Positive Integer ◽  
The Other ◽  
Natural Numbers ◽  
Infinite Set

The present paper concerns the relation of relative interpretability introduced in [8], and arises from a question posed by Tarski: are there two finitely axiomatizable subtheories of the arithmetic of natural numbers neither of which is relatively interpretable in the other? The question was answered affirmatively (without proof) in [3], and the answer was generalized in [4]: for any positive integer n, there exist n finitely axiomatizable subtheories of arithmetic such that no one of them is relatively interpretable in the union of the remainder. A further generalization was announced in [5] and is proved here: there is an infinite set of finitely axiomatizable subtheories of arithmetic such that no one of them is relatively interpretable in the union of the remainder. Several lemmas concerning the existence of self-referential and mutually referential formulas are given in Section 1, and will perhaps be of interest on their own account.

Sign in / Sign up

Export Citation Format

Share Document