Open Access
On a binary problem with prime numbers
Maurizio Laporta
- 01 Jan 1999
Vol. 13, pp 119-123
6
About: The article was published on 01 Jan 1999. and is currently open access. The article focuses on the topics: Prime number & Binary number.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A binary additive equation involving fractional powers
TL;DR: In this paper, it was shown that when 1 < c < \frac{16}{15}, all sufficiently large integers are sufficiently representable, where c is a real number and c < 2.
•Posted Content
A binary additive equation involving fractional powers
TL;DR: In this article, the authors studied the solubility of the binary additive equation in the range of 1 < c < 3/2, where c is a fixed real number.
8
An additive equation involving fractional powers
TL;DR: In this paper, it was shown that almost all $$n\in (N, 2N]$$>>\s can be represented as $$n=[p_1^c]+[p_2^c]$$�, where $$p_ 1$$�, $$p 2$$� are prime numbers and $$[x]$$¯¯¯¯ denotes the integer part of $$x$$�.
2
On a Diophantine equation with prime variables
Jing Huang,Ao Han,Huafeng Liu +2 more
- 01 Jan 2021
TL;DR: In this article, it was shown that for a given integer part of the real number, the exponent pair can be computed in a sufficiently large integer and the exponent part can be expressed as a function of the integer part.
•Posted Content
Some Diophantine equations and inequalities with primes
TL;DR: In this paper, the sum of s powers of primes with non-integer exponent c>1 was studied, where s = 2,3,4,or 5, and the equations were similar, taking integer part before summing; here s = 3 or 5.