All Questions
3 questions
7
votes
2
answers
447
views
Prove that two functions are equal only when $s \equiv \pm r^{\pm 1} \pmod{q}$
Let us fix a positive integer $q$, and let us define a functions $P: \mathbb{Z}\times \mathbb{N} \to \mathbb{Z}$ as follows:
$$ P(s,t) := \sum_{j=1}^t \left\lfloor \frac{j (s-1) + t}{q} \right\rfloor$$...
2
votes
1
answer
1k
views
A formula combining Euler $\phi$ and $\gcd$
Let us fix a natural number $N>1$ and $a_1, \ldots, a_n$ natural numbers satisfying $0 \leq a_i < N$, with the property that $1+ \sum a_i$ is divisible by $N$. Let $\phi$ be the Euler totient ...
0
votes
0
answers
143
views
Given $\,m=\prod_k {p_k}^{\alpha_k}\,$ and the function $\,g(m)=\sum_k \alpha_k(p_k-1)^2$, find all solutions of the equation $\,g(2n)=n$
Let's consider the unique decomposition of a natural number $\,m\,$ into its prime factors:
$$\prod_k {p_k}^{\alpha_k}$$
Then, let's define the following arithmetic function (completely additive) $\,g:...