So the question is, Is there a proof for F(x) = O(x^(1/2-r))?

In summary, the conversation discusses various questions related to Dirichlet series and their convergence. The first question is about the convergence of a series when a constant factor is added to the term. The second question is about the convergence of two Dirichlet series when one is greater than the other. The third question is about the existence of a constant factor for a specific form of a series. The last question is about the proof for the existence of a constant factor for a specific form of a series. The conclusion is that in some cases, such as when r is not equal to 1, the constant factor does not exist.
  • #1
eljose79
1,518
1
let note f(x)=O(g(x)) this f(x)<MG(x) being M a constant then would it be true?..

If f(n)=o(n^u) then Sum(1<n<x)f(n)=O(n^u+1) adn Int(1,x)dnf(n)=O(n^u+1)

Another question let be a(n)n^-s and b(n)n^-s two Dirichlet series so a(n)<b(n) for each n then if b(n)n^-s converges for a number Re(a)>1/2lso the series a(n)n^-s converges for Re(a)>1/2
 
Physics news on Phys.org
  • #2
eljose79 said:
let note f(x)=O(g(x)) this f(x)<MG(x) being M a constant then would it be true?..

If f(n)=o(n^u) then Sum(1<n<x)f(n)=O(n^u+1) adn Int(1,x)dnf(n)=O(n^u+1)

The n in your bounds for the sum and integral should be an x. Also, when u=-1, you get log(x) for a bound, not a constant.

eljose79 said:
Another question let be a(n)n^-s and b(n)n^-s two Dirichlet series so a(n)<b(n) for each n then if b(n)n^-s converges for a number Re(a)>1/2lso the series a(n)n^-s converges for Re(a)>1/2

Hi, assuming both sequences are non-negative, then this looks fine.
 
  • #3
Another question let be F(x)=Sum(n<x)1/n^rthen does exist an r so:

F(x)=O(x^1/2-r)?..where i could find a proof of that?...thanks.
 
  • #4
eljose79 said:
Another question let be F(x)=Sum(n<x)1/n^rthen does exist an r so:

F(x)=O(x^1/2-r)?..where i could find a proof of that?...thanks.

No there doesn't. If r is not 1 then:

[tex]\sum\limits_{n<x}\frac{1}{n^r}=O(x^{1-r})[/tex]

So your asking if there is an r where [tex]1-r\leq 1/2-r[/tex]
Which is of course false.

If r=1, then again, no luck since log(x) is not [tex]O(x^{-1/2})[/tex].
 

FAQ: So the question is, Is there a proof for F(x) = O(x^(1/2-r))?

What is number theory?

Number theory is a branch of mathematics that deals with the properties and relationships of integers and other whole numbers. It involves studying patterns and structures in numbers and using mathematical tools to solve problems related to them.

What are prime numbers?

Prime numbers are positive integers that are divisible only by 1 and themselves. They have exactly two factors and cannot be further divided into smaller whole numbers. Examples of prime numbers include 2, 3, 5, 7, 11, and so on.

What is the importance of prime numbers in number theory?

Prime numbers are considered the building blocks of all positive integers. They play a crucial role in many areas of mathematics, such as cryptography, number theory, and algebra. They also have practical applications in fields like computer science and physics.

What is the difference between prime and composite numbers?

A prime number has exactly two factors, while a composite number has more than two factors. Prime numbers cannot be divided into smaller whole numbers, while composite numbers can be broken down into smaller factors. Examples of composite numbers include 4, 6, 8, 9, and so on.

How are prime numbers used in cryptography?

Prime numbers are used in cryptography to create strong encryption algorithms. For example, the widely used RSA algorithm is based on the difficulty of factoring large prime numbers. Prime numbers also play a vital role in ensuring the security of internet communication and financial transactions.

Back
Top