According to Wikipedia, the Zeta Riemann Function is defined as follows:
\begin{equation}
\zeta(z) = \sum_{k=1}^{\infty}\frac{1}{k^{z}}, \forall z \in \mathbb{C}, Re[Z] > 1.
\end{equation}
Well, the trivial zeros are the negative even numbers. Is that a consequence of the following...
Well, I don't know anything about fortran. But the part the pictures are created is in a loop, right? So you might be looking for http://www.math.yorku.ca/~akuznets/gnufor2/index.html". Read the "character(len=*) :: filename" part.
When you try this, post the your result here, please! I'm...
Thank you, guys!
I've tried to do that:
unsigned long long Z[2][2];
Z[0][0] = 12345678;
And the problem remains! The solution would be dynamic allocation. But nevermind, I don't want to store 2^17*200 elements anymore!
Typing "limitstacksize" on the command line was a great tip!
Thanks, all...
I've declared an unsigned long long bidimentional matrix:
//(...)
typedef unsigned long long int64;
//(...)
row = pow(2,17);
col = 200;
int64 Z[row][col];
Z[0][0] = 12345678;
When the program is initializing Z[0][0], I got a "segmentation fault" message. The Insight Debugger suggests the...