# Tagged Questions

189 views

### Calculating (n ^ fibonacci(k)) MOD m for a large value of k

The value of $k$ can be very large indeed (up to $10^{12}$). Is there an efficient way to calculate the output? Edit : 'm' is a prime number.
396 views

### Average involving the Euler phi function

Does $$\frac{1}{N^2}\sum _{d=1}^N \log d \sum _{n=1}^{N/d} \frac{\phi(n)}{\log (dn)},$$ converges or not when $N$ goes to infinity?
952 views

### Sum of $\sum_{k=1}^nd(k^2)$

There is a literature dealing with $$\sum_{k\le x}d(f(k))$$ where $f$ is an irreducible polynomial and $d(n)$ is the number of divisors of $n$. Erdos 1952 shows that the sum $\asymp x\log x,$ which ...
651 views

### Interesting result on the Euler-Maschroni constant - what is the background?

Today I entered the following expression in maple: $$a_i = H_{10^i} - ln(10^i) - \gamma$$ Here $H_j$ equals $\sum_{k=1}^{j} 1/k$ and $\gamma$ is the Euler-Mascheroni constant. When I computed $a_n$ ...
778 views

### Effective detection of CM modular forms

Say $f$ is a newform of weight $k$ and level $\Gamma_1(N)$. $f$ is called CM if, for example, there is an imaginary quadratic field $K$ such that for all $p\nmid N$ which are inert in $K$, the $p$th ...
1k views

### Computing (on a computer) the first few (non-trivial) zeros of the zeta function of a number field.

Let $M$ be the splitting field of x^8 + 3*x^7 + 13*x^6 + 17*x^5 + 45*x^4 + 37*x^3 + 11*x^2 + 112*x + 108 over the rationals. If I've understood some tables ...
324 views

### Calculating the constant in the Bateman-Horn-Stemmler conjecture

Bateman & Horn [1], building on Bateman & Stemmler [2], give a conjectured formula for the density of numbers that produce simultaneous primes in a number of fixed polynomials. The constant ...
There have been many results on the first sign change of $\pi(x)-{\mathrm{li}}(x)$: among others, Lehman, te Riele, Bays & Hudson, Demichael, Chao & Plymen, and most recently Saouter & ...