Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
0 answers
106 views

Differential duality: Triangular codes vs. VT codes / Single-substitution vs. Single-deletion

Here is the introduction to my problem: Codes correcting single-deletion. Let $q$ and $n$ be non-negative integers, and let $\mathbf{x}= \left ( x_{1}, x_{2}, \ldots, x_{n} \right )\in\mathbb{Z}_{q}^{...
winogradd_15's user avatar
2 votes
1 answer
513 views

Prove ${^{b}a} \equiv {^{b+1}} a \pmod {10^{\lfloor{\log_{10} (^{b}a) }\rfloor + 1}} \Rightarrow a=5$ as $a$ and $b$ are two integers greater than $1$

$\DeclareMathOperator\len{len}$Let $a, b \in \mathbb{N} -\{ 0, 1 \}$ and define ${^{b}a}$ to be $a^a$ if $b = 2$ and $a^{\left(^{b-1}a \right)}$ if $b \geq 3$ (e.g., ${^{3}5} = 5^{\left( 5^5 \right)} =...
Marco Ripà's user avatar
  • 1,451
6 votes
2 answers
645 views

Number of solutions of $am \equiv bn \pmod{q}$

Let $q$ be a (large) prime. Let $N$ be a positive integer of size${}\approx \sqrt{q}$. Let $\mathcal{M}$ be an arbitrary subset of $\{1, \dots, q\},$ such that $\mathcal{M}$ has cardinality $N$. ...
Kurisuto Asutora's user avatar
3 votes
1 answer
392 views

A combinatorial identity involving binomial coefficients

When I was reading an article by CHUN-GANG JI (A SIMPLE PROOF OF A CURIOUS CONGRUENCE BY ZHAO), he mentioned in the acknowledgement the following identity $$\sum_{i+j+k=p,\text{ } i,j,k\gt 0}{p\choose ...
wkmath's user avatar
  • 53
8 votes
2 answers
262 views

Congruences of binomial sums

Let $a_n$ is a binomial sum, for example $$ a_n := \sum_{k} \binom{n-k}{k} \quad \text{or} \quad \sum_{k=0}^n\binom{n+k}{n-k}\binom{2k}{k} \quad \text{or} \quad \sum_{k=0}^n\sum_{\ell=0}^k\binom{n}{k}\...
Igor Pak's user avatar
  • 17k
0 votes
0 answers
132 views

Which consequences can be deduced from this peculiar property of tetration?

Recently (assuming radix-$10$), I showed that, for any $a \in \mathbb{N}_{0}$ that is not a multiple of $10$, there exists a unique value $V(a) \in \mathbb{N}_{0}$ which corresponds to the number of ...
Marco Ripà's user avatar
  • 1,451
4 votes
2 answers
202 views

System of congruences with bound condition

Let $m$ be a positive integer divisible by $6$, and let $q$ be one of $8,9$, or a prime $\gt 3$. Question : Is there always an $x\in [1,m]$, coprime to $m$, such that $x\not\equiv\pm 1 \ \mod{q}$ ? ...
Ewan Delanoy's user avatar
1 vote
1 answer
161 views

A special congruence

For any $a, b\in\mathbb{N}$ with $a+2b\not\equiv 0\pmod 3$, we define $\delta(a, b)$ as follows: \begin{align*} \delta(a, b)={\left\{\begin{array}{rl} 1,\ \ \ \ &{\rm if} \ a+2b\equiv 1\pmod 3,\\ ...
Xiaoer Qin's user avatar
1 vote
0 answers
177 views

Probability of satisfying the congruent mod equation

I'm wondering about the probability of picking three different numbers $x,y,z$ out of the set $[50]=\left\{ 1,2,3,...,50\right\}$ satisfying the equation: $$xyz\equiv \gcd(x,y,z)\mod 7$$ I started out ...
Marek Kryspin's user avatar
7 votes
0 answers
183 views

Some conjectural congruences involving Domb numbers

The Domb numbers are given by $$D_n=\sum_{k=0}^n\binom{n}{k}^2\binom{2k}k\binom{2(n-k)}{n-k}\ \ \ (n=0,1,2,\ldots).$$ Such numbers have combinatorial interpretation, see, e.g., http://oeis.org/A002895....
Zhi-Wei Sun's user avatar
  • 15.6k
6 votes
0 answers
217 views

Two conjectural congruences for Franel numbers

Recall that the Franel numbers are given by $$f_n:=\sum_{k=0}^n \binom{n}{k}^3\ \ \ (n=0,1,\ldots).$$ Question. How to prove my following conjecture? Conjecture. For each odd prime $p$, we have $$\...
Zhi-Wei Sun's user avatar
  • 15.6k
2 votes
1 answer
215 views

Number of odd elements in a vanishing sum of binomial coefficients

Let $n$ be a positive integer, $k$ a non-negative integer and $N(n,k)$ be the number of odd elements among the numbers $\binom{n+k}{j}\binom{-n-k}{n-j}$, $0\le{j}\le{n}$, which sum to $0.$ It seems ...
Johann Cigler's user avatar
3 votes
1 answer
314 views

Probability in $GL_2(\mathbb{Z}/p^{r}\mathbb{Z})$

My question may be not interesting or easy to answer ! but I am really not familiar with proba. Let $p$ be an odd prime number. and let $r\geq1$ an integer. choose an element $A\in\mathrm{GL}_2(\...
Zakariae.B's user avatar
19 votes
2 answers
1k views

A congruence involving binomial coefficients

The following open problem was shown to me by Maxim Kontsevich. I state it in a different but equivalent form. Let $a(n)$ be the sequence at http://oeis.org/A131868, that is, $$ a(n) =\frac{1}{2n^2}\...
Richard Stanley's user avatar
3 votes
1 answer
585 views

Trying to prove a congruence for Stirling numbers of the second kind

This a repost of a question I asked at Stack Exchange, but I got no answer so far, so I am trying here, even though it may not suit the "research level" requirement. Proposition: When $n$ and $m$ are ...
René Gy's user avatar
  • 505