Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
On the blending of real/complex analysis with number theory. The study involves distribution of prime numbers and other problems and helps giving asymptotic estimates to these.
0
votes
Can we balance factors using the set of arithmetic sequence so as to achieve a product quali...
A necessary condition for an example is that there are positive integers $a,b$ such that $\prod_{i=0}^{2N-1}(a+ib)$ is a square. Differently phrased (divide by $b^{2N}$), we ask for rational solutions …
4
votes
Accepted
Prime divisors of $\prod(a_i-a_j)$
Maybe I misunderstand the question, but doesn't the set $A=\{i\cdot n!\,|\,1\le i\le n\}$ have $\lvert\varphi_p(A)\rvert=1$ for all $p$ for which $\varphi_p$ is not injective on $A$?
6
votes
Accepted
Bins-and-primes (prime divisors of $\prod(a_i-a_j)$, II)
The answer is $\varepsilon(n)=1-\frac{2}{n}$. Clearly, $\lvert\varphi_p(A)\rvert\ge2$ for all primes $p$. However,
for every $n\ge2$ there is a set $A$ of size $n$ such that $\lvert\varphi_p(A)\rvert= …
11
votes
Number of elements in the set $\{1,\cdots,n\}\cdot\{1,\cdots,n\}$
The answer is yes, for further infos see the references given at the On-Line Encyclopedia of Integer Sequences.
6
votes
Can one show that $(-1)^{n-1} {(1/\zeta)}^{(n)}(x) >0$ for all real $x>1$?
Here is a more pedestrian version of Fedor Petrov's argument: We set $\lambda=1/\log6$ and claim that $(-1)^n(1/\zeta)^{(n)}(\lambda n)>0$ if $n$ is big enough. With $a_k=\log k/k^\lambda$, we have
\b …
7
votes
Congruences for the non-divisors of Euler's $\phi(n)$
I think both congruences are essentially trivial: As $\varphi(4n+3)$ is even and $(4n+3)-1$ is $2$ times an odd number, the divisors which are counted come in pairs $t,2t$, where $t$ is odd.
Similarl …