1
vote
2answers
28 views

Rational vs irrational

If two points on a number line is shown, are rational numbers between the two points is more or irrational number is more ? I have tried using probability , my collegue who was like my teacher also ...
0
votes
1answer
19 views

Equation with a sum for the prime-counting function involving the Mobius function

I have come across the statement that $$ \sum_{n\leq x}\sum_{d\mid(n,P_z)}\mu(d) = \sum_{d\mid P_z}\mu(d) \left[\frac{x}{d}\right], $$ where $P_z=\prod_{p\leq z}p$ where $p$ is prime, $\mu(d)$ is the ...
1
vote
1answer
30 views

Euler totient function sum of divisors. Theorem 2.2 Apostol

Prove that : $If $ $ n\ge{1} $ $ \sum_{d|n}\phi(d)=N $ $ N \in{\mathbb Z} $ Let S denote the set {1,2,...,n}. We distribute the integers of S into disjoint sets as follows. For each divisor d ...
5
votes
1answer
54 views

Sum of a certain series related to the primes

It is well known that $$\sum_{n > 0}\frac{1}{n}$$ diverges, but $$\sum_{n > 0}\frac{1}{n^2} = \frac{\pi^2}{6}$$ converges. Similarly, $$\sum_{p}\frac{1}{p}$$ diverges, but $$\sum_{p} ...
3
votes
0answers
50 views

Question about the first step in Mann's original proof of the Schnirelmann-Landau Conjecture

I was reading Henry Mann's proof for the Schnirelmann-Landau Conjecture from 1942 which can be found in JSTOR here Today, the Schnirelmann-Landau Conjecture is known as Mann's Theorem: $$d(C) \ge ...
2
votes
1answer
44 views

Trying to understand an assumption in the proof of Mann's Theorem

I am trying to follow the reasoning in the proof of Mann's Theorem: $$d(C) \ge \min(d(A)+d(B),1)$$ I am clear that we can assume that: $d(A) + d(B) \le 1$ We only need to prove that for every $n \ge ...
2
votes
1answer
20 views

Reasoning about Schnirelmann Density: Proving that $d(C) \ge d(A) + d(B)$

I am taking this argument from Gelfond & Linnik's Elementary Methods in the Analytic Theory of Numbers. They state if for every $n \ge 1$, there exists $m \in [1,n]$ where $C(n) - C(n-m) \ge ...
1
vote
1answer
17 views

Question about Schnirelmann Density and Sumset: if $d(A) \ge \frac{1}{2}$ and $d(B) > 0$, wouldn't $d(A+B)=1$

I've been thinking about the Schnirelmann Density and I think that I may still be confused about SumSet and Density. It seems to me that if $d(A) \ge \frac{1}{2}$ and $d(B) > 0$, then $d(A+{B}) = ...
3
votes
1answer
63 views

Schnirelmann Density: if $d(A) + d(B) \ge 1$, does it follow that $d(A+B)=1$

I am still trying to get my head around the basic properties of Schnirelmann Density. If I'm reading PlanetMath.org correctly, it states that if $d(A) + d(B) \ge 1$, then $d(A+B)=1$ Here's the exact ...
2
votes
1answer
30 views

Question about the properties of Shnirelman density

In elementary methods in analytic number theory by Gelfond and Linnik, the claim is made that if $d(A) + d(B) > 1$, then we can find $A',B'$ where $A' \subseteq A$ and $B' \subseteq B$ such that ...
4
votes
1answer
68 views

Prove that $2^x < \prod_{p\le x} p < (13/4)^x$ for sufficiently large x

Prove that $2^x < \prod_{p\le x} p < (13/4)^x$ for sufficiently large x. Here $p$ is prime. So if we take logs we need to show for sufficiently large x, $x\log 2 < \sum_{p\le x}\log p < ...
0
votes
0answers
36 views

Looking for help understanding the proof behind Schnirelmann Theorem: $d(A+B) \ge d(A) + d(B) - d(A)d(B)$

I am trying to understand the proof by Gelfond & Linnik that: $$d(A+B) \ge d(A) + d(B) - d(A)d(B)$$ Here's what I understand: Let $A$, $B$ be infinite sequences of integers starting with $0$ ...
5
votes
1answer
131 views

How to prove this inequality $\pi(x) > \log x - 1$ involving the prime counting function?

Problem Prove that $\pi(x) > \log x - 1$. Progress Based on a hint and very elementary methods, I got that $$ \prod_{p \leq x} (1-p^{-1})^{-1} \leq \prod_{k=2}^{\pi(x)+1} (1-k^{-1})^{-1}. $$ The ...
1
vote
1answer
43 views

Additive properties of sequences: trying to understand Schnirelmann density

I have started reading Gelford & Linnik's elementary methods in analytic number theory (1965). They define a sequence $A$ of integers as: $$0, a_1, a_2,a_3,\dots$$ where $$0 < a_1 < a_2 ...
3
votes
2answers
116 views

Proving all sufficiently large integers can be written in the form $a^2+pq$.

This is one of those numerous questions I ask myself, and to which I seem unable to answer: Can every integer greater then $657$ be written in the form $a^2+pq$, with $a\in\mathbb Z$ and $p,q$ ...
3
votes
3answers
106 views

What does the integer span of one irrational, and one (possibly irrational) real number look like in $\mathbb{R}$?

My title was rejected a few times, here is what it was initially: If you take two real numbers- one irrational and one possibly irrational - how close does their $\mathbb{Z}$ span come to any ...
1
vote
0answers
36 views

Compute $\phi^{-1}(k)$, $\phi$ Euler's totient function? [duplicate]

Given a positive integer $k$, I'd like to be able to compute the set of positive integers $m$ such that $m$ is prime to precisely $k$ positive integers less than $m$. In other words, I'd like to ...
0
votes
1answer
51 views

Where are the resources on the prime number theorem?

I am looking for resources which explain the prime number theorem to 18 year old students. I am not seeking a proof of the result but something which will have an impact and motivate a student to ...
0
votes
0answers
69 views

Count of numbers with the given prime factors in a range [duplicate]

Given two primes: $p$ and $q$, $p \neq q$ and $n \in N$ find count of numbers $u$, so that $u \leq n$ and $u = p^k q^l$; $k, l \in N$. If we'd given with just one prime $p$ this count would be ...
1
vote
2answers
149 views

Arithmetical functions summation

Problem (7.4.15) of Burton's Elementary Number Theory has been request that prove the following equalities. In this book isn't expressed Dirichlet multiplication and Riemann's zeta function before ...
0
votes
0answers
136 views

How to prove that homometric sets lead to same result in this problem? (any justifications?)

First let me define Difference multiset for a set of integers $$P=\{p_1,p_2, \dots,p_K\} ,\quad p_i \in\{1,2,\dots,N\},\quad p_i\ne p_j $$ as below: $$ D = \{p_i-p_j \mod N ,\quad i \ne j\} $$ I ...
0
votes
0answers
52 views

order of magnitude of first moment of prime's distribution?

I have these this question in mind for a while and struggling with. Question: Is it possible to define a first moment (mean) of the distribution of the primes' infinite sequence? And if this can be ...
5
votes
0answers
204 views

Maximum length of sequence of non-coprimes of $N$ - least upper bound for Jacobsthal's function

I am looking at the length of the longest sequences of adjacent integers that are not coprime to $N$ for very large $N$. Let $F_N$ be the set of integers less than $N$ which are not coprime with $N$: ...
1
vote
1answer
114 views

Challenging the Chebychev function / prime number theorem?

The prime number theorem accords with the following equation for the first Chebychev function that: $$\lim_{x\rightarrow\infty}\frac{\vartheta(x)}{x}=1 \qquad (1)$$ According to Muñoz García, E. and ...
0
votes
0answers
44 views

How to introduce an integer function into $\zeta$ function instead of $n$

I have a problem that I am struggling with since long and probably it is simple but I can not get through. So your help would be very welcome. Known that Riemann $\zeta$ function is defined as sum ...
5
votes
0answers
101 views

Best upper bound on the number of divisors of $n$ that are larger than $N$.

I am looking for the best upper bound on $$\sum_{\substack{d | n\\ d \geq N}} 1.$$ I know that $$ d(n) = \sum_{\substack{d | n}} 1 \leq e^{O(\frac{\log n}{\log \log n})}. $$ For my application, I ...
2
votes
1answer
62 views

Lemma from arithmetic functions

Let $f$ arithmetic and $$H(f)=\lim_{x\rightarrow \infty}\frac{1}{x\log x}\sum_{n\leq x}f(n)\log n,$$ Then $H(f)$ exists if and only if $M(f)$ exists, and $M(f)=H(f)$ Where $$M(f)=\lim_{x\rightarrow ...
0
votes
0answers
54 views

Statements that are equivalents [duplicate]

Using the fact that: 1)$\qquad\theta(x)=\sum\limits_{p\leq x}\log p$ 2)$\qquad\psi(x)=\sum\limits_{n\leq x}\Lambda (n)$ . Where $$ \Lambda(n) \stackrel{}{=} \begin{cases} 0 & \text{if $ n ...
3
votes
1answer
151 views

Proving equivalences between prime counting functions.

If we have that: $$\theta(x)=\sum_{p\leq x}\log p,$$ and $$\psi(x)=\sum_{n\leq x}\Lambda(n)$$ Where $\Lambda(n)=\log p $ if $n=p^m$ and $\Lambda(n)=0$ in another case. How can I prove that : 1) ...
9
votes
1answer
235 views

Sum of square root of primes

I was playing around with prime numbers and a question came into my mind: Let $S(n)$ denote the sum of square roots of primes from $2$ to the $n$th prime number. Are there infinitely many numbers $n$ ...
16
votes
5answers
978 views

Intervals that are free of primes

How can I prove that exists intervals as large as I want that are free of primes? I mean, $\forall \ k \in \mathbb{N}, \exists \ k$ consecutive positive integers none of which is a prime.
1
vote
1answer
185 views

For what primes $p$ does the series $1!+2!+3!+4!+ \cdots $ converge $p$-adically?

this is a question from a book I'm struggling with, please could you provide a clear proof For what primes p does the series $1!+2!+3!+4!+ \cdots $ converge $p$-adically? kind thanks
0
votes
1answer
60 views

For which primes p does the series $\sum_{i=0}^\infty (\frac{10}{11})^i$ converge p-adically

For which primes p does the series $\sum_{i=0}^\infty (\frac{10}{11})^i$ converge p-adically and, when it does, to what limit?
0
votes
0answers
210 views

Show that the field of p-adic numbers is complete

this is a question from a book I'm struggling with, please could you provide a clear proof Show that the field of p-adic numbers is complete i.e. that a sequence of p-adic numbers converges if and ...
0
votes
1answer
74 views

Polynomial that permutes residue classes

Prove that for any integers $d, e > 1$, the polynomial $f$ with integer coefficients permutes the residue classes modulo $p^d$ if and only if it permutes the residue classes modulo $p^e$ where $p$ ...
3
votes
1answer
547 views

Change of order of summation.

I feel like an idiot for asking this, so bear my stupidity. I have the sum $\sum_{n\leq N} \sum_{p | n ; \ p \ prime} 1$, and I want to change the order of summation of these two sums I think it ...
2
votes
1answer
133 views

Sum of exponents equivalent to card(composites less than or equal to x)?

Consider a cousin of the Chebyshev function: $$t(x) = \sum \alpha_i $$ such that $$ p_i^{\alpha_i }= x, \ p_i \leq x$$ I speculated that $ t(x) \sim C(x)$, the composites $\leq(x)$ If $t(x) = ...
1
vote
3answers
263 views

How to prove $\sum_{d|n} {\tau}^3(d)=\left(\sum_{d|n}{\tau}(d)\right)^2$

$\sum_{d|n} {\tau}^3(d)=\left(\sum_{d|n}{\tau}(d)\right)^2$, where $\tau(d)$ designates the number of positive divisors of d. Now I only know that both sides are multiplicative functions, could ...
9
votes
4answers
292 views

Representing a number as a sum of at most $k$ squares

Fix an integer $k >0 $ and would like to know the maximum number of different ways that a number $n$ can be expressed as a sum of $k$ squares, i.e. the number of integer solutions to $$ n = x_1^2 + ...