Tagged Questions

4
votes
0answers
55 views

Trying to show that $\ln(x!) - \ln(\lfloor\frac{x}{2}\rfloor!) - \ln(\lfloor\frac{x}{3}\rfloor!) - \ln(\lfloor\frac{x}{6}\rfloor!) \ge \psi(x)$

I've been told that the approach below will not work. I would be interested if someone could help me to understand what will go wrong. Let: $$\psi(x) = \sum\limits_{p^k \le x} \ln p$$ So that (see ...
5
votes
4answers
116 views

Summation of logs

Are there any useful identities for quickly calculating the sum of consecutive logs? For example $\sum_{k=1}^{N} log(k)$ or something to this effect. I should add that I am writing code to do this (as ...
4
votes
0answers
78 views

Generalizing Jitsuro Nagura's result: my resulting upper bound for the second chebyshev function is too low. What am I doing wrong?

I've been reading through Jitsuro Nagura's classic proof that there is a prime between $x$ and $\frac{6x}{5}$ and it seems to me that it should be possible to improve on his upper bound for the second ...
0
votes
0answers
58 views

Using Stirling's Formula to approximate a difference of logarithms of factorials in the same way as Jitsuro Nagura.

In Jitsuro Nagura's classic proof of a prime existing between $x$ and $\frac{6x}{5}$, he uses Stirling's formula to show that: $$T\left(x\right) - T\left(\frac{x}{2}\right) - ...
0
votes
0answers
42 views

Do these inequalities regarding the gamma function and factorials work?

I am seeing if it is possible to generalize lemma 1 in Nagura's proof that there is always a prime between $x$ and $\frac{6x}{5}$. In a previous question, I asked whether the following inequality is ...
2
votes
0answers
55 views

Trying to generalize an inequality from Jitsuro Nagura: Does this work?

I am investigating the generality of Lemma 1 in Nagura's proof that there is always a prime between $x$ and $\frac{6x}{5}$. In Lemma 1, Nagura establishes when $n > 1$, $x \ge 1$: ...
4
votes
1answer
46 views

Looking for help in understanding Jitsuro Nagura's analysis of the upper bound for $\psi(x)$

I'm working on understanding Nagura's analysis of the upper bound for $\psi(x)$ which is done in Lemma 2. I am unclear on one step of his reasoning. With Lemma 1, he establishes for $x \ge 2000$: ...
5
votes
1answer
98 views

Understanding a famous proof by Jitsuro Nagura: Need help understanding one step in the main theorem

I am going through the proof by Jitsuro Nagura which shows that there is always a prime between $x$ and $\frac{6x}{5}$ where $x \ge 25$. Nagura uses the following definitions: $$\vartheta(x) = ...
0
votes
1answer
68 views

Proving that a specific gamma function is a guaranteed lower bound for a factorial function

In reviewing Ramanujan's proof of Bertrand's postulate, Ramanujan observes that: $$\ln\Gamma(x) - 2\ln\Gamma(\frac{x+1}{2}) \le \ln(\lfloor{x}\rfloor!) - 2\ln(\lfloor\frac{x}{2}\rfloor!)$$ I have ...
0
votes
1answer
37 views

Is it possible to generalize Ramanujan's lower bound for factorials when $\{\frac{x}{b_2}\} + \{\frac{x}{b_3}\} < 1$?

This is the second attempt at a proof. My first attempt had a flaw in its logic. After reviewing the mistake in logic, I believe that with a revised logic, the argument can be saved. The revision ...
1
vote
0answers
28 views

Is it possible to generalize Ramanujan's lower bound for factorials when $\{\frac{x}{b_2}\} + \{\frac{x}{b_3}\} \ge 1$?

This is the second attempt at a proof. My first attempt had a flaw in its logic. After reviewing the mistake in logic, I believe that with a revised logic, the argument can be saved. The revision ...
8
votes
1answer
205 views

Is it possible to generalize Ramanujan's lower bound for factorials that he used in his proof of Bertrand's Postulate?

I am starting to feel more confident in my understanding of Ramanujan's proof of Bertrand's postulate. I hope that I am not getting overconfident. In particular, Ramanujan's does the following ...
0
votes
4answers
129 views

Why aren't logarithms defined for negative $x$?

Given a logarithm is true, if and only if, $y = \log_b{x}$ and $b^y = x$ (and $x$ and $b$ are positive, and $b$ is not equal to $1$)[1], are true, why aren't logarithms defined for negative ...
21
votes
0answers
414 views

Generalizing Ramanujan's proof of Bertrand's Postulate: Can Ramanujan's approach be used to show a prime between $4x$ and $5x$ for $x \ge 3$

Perhaps, I've been thinking too long about Ramanujan's proof, but it appears to me that his argument can be generalized beyond $x$ and $2x$. My argument below attempts to show that for $x \ge 1331$, ...
3
votes
1answer
55 views

Reasoning about the Chebyshev functions: How does one check an upper bound based on the second Chebyshev function?

In Ramanujan's proof of Bertrand's Postulate, Ramanujan states: $\log([x]!) - 2\log([\frac{1}{2}x]!) \le \psi(x) - \psi(\frac{1}{2}x) + \psi(\frac{1}{3}x)$ where: $\vartheta(x) = \sum_{p \le x} ...
1
vote
1answer
69 views

Solving $ f(\log x)$

A generalization of the conjecture $$\pi(x+x^{\theta}) - \pi(x) \sim \frac{x^\theta}{\log x} $$ (Ingham, 1937 or earlier) might be $$\Delta \pi_k = \pi_k((x+1)^2) - \pi_k(x^2)\sim \frac{x}{\log ...
2
votes
1answer
253 views

Chebyshev's first $\vartheta(x)$ function question

This was an exercise using the first Chebyshev function, $\vartheta(x)= \sum_{p \leq x} \log p.$ The question is simply how to prove (2) below, the rest is my two thoughts on how to proceed. [Edit: ...
17
votes
1answer
238 views

Approximation of $\log(x)$ as a linear combination of $\log(2)$ and $\log(3)$

I wonder if it's possible to approximate $\log(n)$, n integer, by using a linear combination of $\log(2)$ and $\log(3)$. More formally, given integer $n$ and and real $\epsilon>0$, is it always ...
1
vote
3answers
55 views

If $\log_{b}N$ is rational, what are the limitations on the possible values of $b$ and $N$?

If $\log_{b}N$ is rational, is there a set of values to which $b$ and $N$ must belong? Is there a set of values to which $b$ and $N$ cannot belong? Further, if it is presupposed that $b$ and $N$ are ...
13
votes
3answers
370 views

Are the logarithms in number theory natural?

I find the frequent emergence of logarithms and even nested logarithms in number theory, especially the prime number counting business, somewhat unsettling. What is the reason for them? Has it maybe ...
1
vote
1answer
82 views

Number of digits in different number systems?

I know a similar question was asked before, but I wanted to know if this can be extended to any number system by a generic formula. For example, given a number X in number system A, how many digits ...
1
vote
1answer
209 views

Discrete logarithm to a primitive root base

I need to find out $\log_g {-1}$ in $\mathbb{Z}_n$ where $n$ is an odd prime and $g$ is a primitive root mod $n$. How do I do that? Thanks.