**Statistics**

RANK**5 830**

of 281 780

REPUTATION**7**

CONTRIBUTIONS

**8** Questions

**3** Answers

ANSWER ACCEPTANCE **
62.5%
**

VOTES RECEIVED**7**

RANK**9 792** of 19 060

REPUTATION**59**

AVERAGE RATING**3.70**

CONTRIBUTIONS**18** Files

DOWNLOADS **28**

ALL TIME DOWNLOADS**422**

RANK

of 134 119

CONTRIBUTIONS

**0** Problems

**0** Solutions

SCORE**0**

NUMBER OF BADGES**0**

CONTRIBUTIONS**0 Posts**

CONTRIBUTIONS**0** Public Channels

AVERAGE RATING

CONTRIBUTIONS**0** Highlights

AVERAGE NO. OF LIKES

**Content Feed**

Submitted

discrete logarithm

compute the discrete logarithm using Shank's algorithm

4 dagar ago | 1 download |

How to create an array of matrices?

function aM = arrayofmatrices(A,B,C) aM(:,:,1) = A; aM(:,:,2) = B; aM(:,:,3) = C; end This only works when A, B and C hav...

3 månader ago | 0

Question

I try to find a general vector base for all magic squares of dimension n . Why does this program work for n = 3, but not vor n > 3?

The program below is supposed to find a general vector base for all magic squares of dimension n . Why does this program work fo...

3 månader ago | 1 answer | 0

### 1

answerHow can i check if a matrix is magic square or not?

try: function ismagic = ismagic(M) %ISMAGIC checks if a matrix M is a magic square or not if size(M,1) ~= size(M,2) is...

3 månader ago | 0

How can i create array of symbolic expressions?

does this help? function array_of_symbolicExpressions(mx) syms t y(t); y(t) = t^3+t^2; % just an example d = diff(y); ...

3 månader ago | 0

Submitted

Simple Chess game

I tried to keep it "minimalistic", so strength isn't great.

ungefär ett år ago | 5 downloads |

Submitted

Two versions of Pollard's rho factorization algorithm

one version with Brent's style cycle detection, one without but using vectors and matrices

mer än ett år ago | 2 downloads |

Submitted

sieve of Erathostenes

a simple number sieve, which could (in theory) run forever, because it does not require an interval to be sieved.

mer än ett år ago | 1 download |

Question

why is this Matlab Code faster than the C++ code below? I want to understand what Matlab internally does better and faster than C++

why is this Matlab Code function primes = sieve_era2(N) % sieve of Erathostenes without upper bound of search space (could th...

mer än ett år ago | 2 answers | 2

### 2

answersSubmitted

find zeros of the Riemann zeta function

This function finds zeros of the Riemann zeta function on the critical line 0.5 + i*t in an interval von <= t <= bis

nästan 2 år ago | 2 downloads |

Question

Approximation of pi is "too precise" .

The function below should approximate pi adding about 2 digits of precision for increasing n. Why is piApprox2(3) exactly = pi ...

mer än 2 år ago | 1 answer | 0

### 1

answerSubmitted

two ways to compute Riemanns prime counting function

one version which works (J2) and one which does not work (J1).

mer än 2 år ago | 1 download |

Question

Cannot start Matlab - getting error "std::exception: Loading D:\Program Files\MATLAB\R2019b\bin\win64\matlab_startup_plugins\Imgrimpl\lib

When I start Matlab from the Desktop Icon or from the task bar, I get this error: "std::exception: Loading D:\Program Files\M...

mer än 2 år ago | 0 answers | 3

### 0

answersSubmitted

convert integer to binary or binary to integer

convert a column vetor of integers to a column vector of binaries or vice versa

mer än 2 år ago | 1 download |

Submitted

zetaRS approximates Riemann's zeta(0.5 + i*t) for large t

Fast computation of Riemann's zeta function on the critical strip using the Riemann Siegel formula.

nästan 3 år ago | 1 download |

Question

using fzero with arrayfun searching for zeros inside an interval

I have a function f = @(x) -x.^2+4 with a zero at -2 and +2 using fzero(f, [-3, 1.9]) I get the (correct) zero inside the inte...

nästan 3 år ago | 1 answer | 0

### 1

answerSubmitted

Fast approximation of Pi

Approximate Pi with 16th order convergence

nästan 3 år ago | 1 download |

Submitted

Create and run Turing machines

Some tools and examples for creating and simulating Turing machines and macro-Turing machines.

nästan 3 år ago | 1 download |

Submitted

Computation of the rado function

More sophisticated check for endless loops, support for parallel execution and the use of macro-Turing-machines

ungefär 3 år ago | 1 download |

Submitted

uncover the call structure of a recursive function call

recurse(tree) helps to uncover the call structure of a recursive function call.

ungefär 3 år ago | 1 download |

Submitted

GaussLegendre

quick approximation of pi using the Gauss-Legendre algorithm

mer än 3 år ago | 1 download |

Submitted

two versions of the Euler-phi function

two brief implementations of the Eulerphi function

mer än 3 år ago | 1 download |

Question

Extract lines of a three dimensional matrix using an array of indices and NO for-loop

I have a three dimensional 10x5x2 array. Example: r(:,:,1) = [1 0 2 1 1; 2 0 3 1 1; 3 0 4 1 1; 4 0 1 1 -1; 5 0 -1 1 1; 1 1 3 1...

mer än 3 år ago | 1 answer | 0

### 1

answerSubmitted

Computation of Rado-function

Recursive computation of the "uncomputable" Rado-function.

mer än 3 år ago | 1 download |

Submitted

Karatsuba algorithm for fast multiplication

Multiplication of "x" and "y" with Karatsuba method using base "base" x , y and base can be freely chosen

nästan 4 år ago | 3 downloads |

Submitted

Shor Algorithm for prime factoring

A Version of the Shor-Algorithm for prime Factoring. Please feel free to comment on it or recommend improvements.

nästan 4 år ago | 3 downloads |

Question

trying to compute Riemann's prime counting function J(x)

I am trying to compute Riemann's prime counting function J(x): J(x) should approximate the numbers of primes <= x using thi...

ungefär 4 år ago | 2 answers | 0

### 2

answersQuestion

isprime function seems to have poor performance

Why is MatLab's "isprime" function so much slower than Octave's "isprime" function? I am using MatLab's "isprime" function to c...

ungefär 4 år ago | 4 answers | 2