Results 11 to 20 of about 126,211 (116)

ON THE WARING–GOLDBACH PROBLEM WITH ALMOST EQUAL SUMMANDS [PDF]

open access: yesMathematika, 2019
We use transference principle to show that whenever $s$ is suitably large depending on $k \geq 2$, every sufficiently large natural number $n$ satisfying some congruence conditions can be written in the form $n = p_1^k + \dots + p_s^k$, where $p_1, \dots,
Juho Salmensuu
semanticscholar   +6 more sources

Another Waring–Goldbach problem

open access: yesActa Arithmetica, 2023
In the paper under review, the author establishes a Waring-Goldbach analogue of a past result of C. Hooley. More specifically, \textit{C. Hooley} [Symp. Durham 1979, Vol. 1, 127--191 (1981; Zbl 0463.10037)] proved the theorem that for large \(n\), the Diophantine equation \[ x_1^2+x_2^2+x_3^3+x_4^4+x_5^5+x_6^6+x_7^7=n \tag{1} \] has solutions in non ...
J. Brüdern
semanticscholar   +3 more sources

Waring-Goldbach problem: two squares and higher powers [PDF]

open access: yesActa Arithmetica, 2017
\textit{L.~K.~Hua} [Q. J. Math., Oxf. Ser. 9, 68-80 (1938; Zbl 0018.29404)] showed that large numbers are sums of nine cubes of primes. Let \(E(N)\) denote the number of numbers not exceeding~\(N\), are \(\not\equiv 0,\pm 2\) (mod~9), and are not sums of five cubes of primes.
Yingchun Cai, Yingchun Cai
semanticscholar   +2 more sources

The quadratic Waring–Goldbach problem

open access: yesJournal of Number Theory, 2004
The purpose of this paper is to show a new bound for the number \(E(N)\), say, of the natural numbers \(n\) such that \(n\leq N\), \(n\equiv4\pmod {24}\), and \(n\) cannot be written as the sum of four squares of primes. Actually, the authors establish the bound \(E(N)\ll N^{3/8+\varepsilon}\) with any fixed \(\varepsilon>0\). The proof is based on the
Jianya Liu, T. Wooley, Gang Yu
semanticscholar   +3 more sources

Sums of One Prime Power and Four Prime Cubes in Short Intervals

open access: yesJournal of Mathematics, Volume 2023, Issue 1, 2023., 2023
Let k⩾1 be an integer. In this study, we derive an asymptotic formula for the average number of representations of integers n=p1k+p23+p33+p43+p53 in short intervals, where p1, p2, p3, p4, p5 are prime numbers.
Gen Li   +4 more
wiley   +1 more source

Facing the heat: Political instability and firm new product innovation in sub‐Saharan Africa

open access: yesJournal of Product Innovation Management, Volume 39, Issue 5, Page 604-642, September 2022., 2022
Abstract We examine how political instability (PI) affects firms' product innovation and the strategies that firms can employ in response to PI. We argue that while higher levels of PI influence firms' innovation negatively, greater international exposure (through foreign ownership and exporting) can help firms partly overcome this external challenge ...
Sorin M. S. Krammer, Mario I. Kafouros
wiley   +1 more source

One Kind New Hybrid Power Mean and Its Computational Formulae

open access: yesJournal of Mathematics, Volume 2022, Issue 1, 2022., 2022
The main purpose of this study is to use the elementary and analytic methods and the properties of the classical Gauss sums to study the calculation problems of one kind of hybrid power mean involving the quadratic character sums and the two‐term exponential sums and give an exact computational formula for it.
Li Wang, Xuexia Wang, Shaofang Hong
wiley   +1 more source

Pace of life and perceived stress in international students

open access: yesPsyCh Journal, Volume 10, Issue 3, Page 425-436, June 2021., 2021
Abstract An accelerated pace of life greatly impacts individuals' health and lifestyles. However, this imposition has not been systematically researched within a culturally diverse sample. Thus, this study aimed to explore the subjective experience of the pace of life and its correlates in a culturally diverse sample within a German university context.
Sonia Lippke   +3 more
wiley   +1 more source

On a Diophantine Inequality with s Primes

open access: yesJournal of Mathematics, Volume 2021, Issue 1, 2021., 2021
Let 2 < c < δ. In this study, for prime numbers p1, …, ps and a sufficiently large real number N, we prove the Diophantine inequality p1c+⋯+psc−N
Xiaofei Yan, Lu Zhang, Wenpeng Zhang
wiley   +1 more source

Home - About - Disclaimer - Privacy