# Tag Info

### Prime numbers made of permutations of digits of consecutive positive integers

We knows that no prime of the form $1\_2\_...\_n$ has been found yet... at least for $n$ up to $10^6$ (see https://mathworld.wolfram.com/SmarandachePrime.html). Now, a partial answer to your question ...
1 vote

### Prime numbers made of permutations of digits of consecutive positive integers

My impression is that the prime numbers in $S(3k+1)$ are exactly in the proportion they should be. Note that numbers in $S(3k+1)$ are smaller than $10^{D(3k+1)-1}$ because they have $D(3k+1)$ digits. ...
• 1,440

### Vandermonde $V_n$ mod $n$

OP asked me to fill in the details of my comment, and in attempting to do so I realised that I claimed too much. However, a very similar argument proves a weaker result which is strong enough to ...
• 4,332

### Vandermonde $V_n$ mod $n$

Per comments above, for a counterexample we have with necessity $\pi_n=n$ and prime $n$. The case $n=2$ is trivial, so I assume that $n$ is an odd prime. The elements $U:=\{ 1,2,\dots,n-1\}$ form the ...
Accepted

### Given $\pi$ permutation on $\{1,\dotsc,n\}$, what is the sign of a permutation of $\{2,\dotsc,\hat\jmath,\dotsc,n\}$?

$\DeclareMathOperator\sgn{sgn}$This is almost the same as your previous question, just with the order of the operations switched—whether you think of $\pi$ as ordering or disordering is just a matter ...
• 7,931
Accepted

### Sign of the permutation which brings a subsequence back to its original form

Imagine a bubble sort where you bring each element to its original position. $x_1$ would have taken $\pi^{-1}(1) - 1$ transpositions to bring it back to its original position. Let's perform those ...
• 7,931

### Integer eigenvalues of a class of matrices inspired by Prof. Zhi-Wei Sun's conjecture

Fourier transform does it. Denote by $u_j$ $(j=0,1,\ldots,n-1$) the column-vector with coordinates $(x_{ji})_{1\leqslant i\leqslant n-1}$. Note that $u_0+u_1+\ldots+u_{n-1}=0$ and any $n-1$ vectors \$...
• 88.6k