4,132 reputation
21134
bio website
location Istanbul
age
visits member for 3 years, 3 months
seen 6 hours ago

13h
revised Minimal distance limit problem
added 75 characters in body
2d
comment Numbers that are divisible by the number of primes smaller than them
On second thought there is no obligation on your part, so I will just mention here that the question (and the proof below) were noted in another question mathoverflow.net/questions/139934/….
2d
comment Numbers that are divisible by the number of primes smaller than them
This was in AMM vol. 69. no.1 1962. It might be good to include the full cite in case someone wants to look it up.+1 for the information.
Jan
26
comment Trying to understand a step in Ramanujan's Proof of Bertrand's Postulate regarding the gamma function
Yes unfortunate about the notation. It is not the digamma function. Ramanujan's version of this proof is clearer IMO (I looked at the one you are working from). The main definition that is omitted from your version is $\log[x]! = \psi(x)+\psi(x/2)+\psi(x/3)+...$ I have to run but glad to help if someone else doesn't beat me to it.
Jan
25
comment What is the inverse of the divisor sum function $\sigma $?
I wonder if the title shouldn't be changed. You are looking for something very specific and neither the title nor the question make it clear exactly what that is.
Jan
24
comment Numbers that are divisible by the number of primes smaller than them
@PeterWoolfitt: $175197/\pi(175197) = 11.$
Jan
24
comment Numbers that are divisible by the number of primes smaller than them
Your idea is true through k=14 (which causes my computer to smoke).
Jan
24
comment Numbers that are divisible by the number of primes smaller than them
How far did you check, out of curiosity?
Jan
24
comment Numbers that are divisible by the number of primes smaller than them
k = 11 only occurs once so the "intuition" seems shaky.
Jan
24
comment What is umbral calculus, really?
The material in the earlier question (What's umbral calculus about?) may be challenging but I don't think any two-sentence answer here will clarify it. You are asking that the question be answered again.
Jan
24
comment Paul Erdős showed a simple estimate for $\pi(x) \ge \frac{1}{2}\log_2 x$; is it possible to tweak his argument to improve the estimate?
Considering the research that has gone into approximations of $\pi(x)$ it is no surprise that an approximation $\hat{\pi}(x)$ and a factor $(1-\epsilon)$ give a lower bound $\hat{\pi}(1-\epsilon)$ that is better than something derived for another purpose. Even Dusart's weaker bounds (Wiki) are much better than the one here. Nice idea though.
Jan
23
comment Question about Paul Erdős’ proof on the infinitude of primes
Oh--thanks for some reason I didn't see any message notice for the (probably another came up at same time). Appreciate it.
Jan
23
comment What is the inverse of the divisor sum function $\sigma $?
@ndroock1: is the object still to show that $\sigma*\sigma^{-1}= I?$
Jan
23
comment What is the inverse of the divisor sum function $\sigma $?
@ErickWong: that's theorem 2.20 (in the one-line proof).
Jan
23
comment What is the inverse of the divisor sum function $\sigma $?
Is Apostol's Theorem 2.20 any better?
Jan
23
comment Question about Paul Erdős’ proof on the infinitude of primes
Would it be possible to give the page reference for the passage in Havil since it is not in the index?
Jan
23
comment Finding the largest factorial of only three digits
The tags for this question are not really right if the question is about the code.
Jan
23
comment Consecutive numbers that share the same sum of prime factors
Mathematica is very good for this purpose. It lists the first 200000 values of f in about 10 seconds. With a little extra effort you could get it to find pairs $f(n+1)=f(n).$
Jan
22
comment Consecutive numbers that share the same sum of prime factors
How far is "not very far?"
Jan
22
comment Consecutive numbers that share the same sum of prime factors
Related to Catalan's conjecture how? How far have you searched?