单位根反演小记

最新推荐文章于 2022-11-02 10:57:53 发布

_lifehappy_

最新推荐文章于 2022-11-02 10:57:53 发布

阅读量283

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/weixin_45483201/article/details/115048271

版权

数论专栏收录该内容

107 篇文章 6 订阅

订阅专栏

单位根反演

一个等式： $\mid a] = \frac{1}{n} \sum\limits_{k = 0} ^{n - 1}w_n ^{ak}$

证明：

$w_n ^ a$ 是 $n$ 次单位根的 $a$ 次方，所以这里是一个公比为 $w_n ^ a$ 的等比数列，

考虑公比不为 $1$ ，等比数列求和 $\frac{1}{n} \frac{w_n ^ 0(w_n ^ {an} - 1)}{w_n ^ a - 1}$ ，有 $w_n ^{an} - 1 = w_1 ^ a - 1 = 0$ ，所以该等比数列求和为 $0$ ，

如果 $\mid a$ ，有 $w_n ^ {ak} = w_{1} ^{\frac{a}{n}k} = 1$ ，所以有 $\mid a] = \frac{1}{n} \sum\limits_{k = 0} ^{n - 1} 1 = 1$ 。

而有下面的推论：

$\equiv b \pmod{ n}$ ，有 $\equiv 0 \pmod{n}$ ， $\mid a - b] = \frac{1} {n} \sum\limits_{k = 0} ^{n - 1} w_n ^{ka} w_{n} ^{-kb}$ 。

#6485. LJJ 学二项式定理

$\sum_{i = 0} ^{n} (_i ^ n) s ^ i a_{i\mod4}\\ \sum_{i = 0} ^{n} (_i ^ n) s ^ i \sum_{j = 0} ^{3} a_j[i \equiv j \pmod{4}]\\ \sum_{i = 0} ^{n} (_i ^ n) s ^ i \sum_{j = 0} ^{3} a_j \frac{1}{4} \sum_{k = 0} ^{3} w_{4} ^{k(i - j)}\\ \frac{1}{4} \sum_{j = 0} ^{3} a_j \sum_{k = 0} ^{3} w_4 ^{-kj} \sum_{i = 0} ^{n} (_i ^ n) s ^ i w_4 ^{ki}\\ \frac{1}{4} \sum_{j = 0} ^{3} a_j \sum_{k = 0} ^{3} w_4 ^{-kj} (sw_4 ^ k + 1) ^ n\\$
有 $998244353$ 下的单位根是 $3$ ，所以 $w_4 ^ 1 = 3 ^{\frac{mod - 1}{4}}$ ， $w_4 ^ 1) ^ 4 = 3 ^{mod - 1} = 1$ ，快速幂即可。

#include <bits/stdc++.h>

using namespace std;

const int mod = 998244353, w[4] = {1, 911660635, 998244352, 86583718};

int quick_pow(int a, int n) {
  int ans = 1;
  while (n) {
    if (n & 1) {
      ans = 1ll * ans * a % mod;
    }
    a = 1ll * a * a % mod;
    n >>= 1;
  }
  return ans;
}

int main() {
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  int T, inv4 = quick_pow(4, mod - 2);
  scanf("%d", &T);
  while (T--) {
    long long n, ans = 0, sum, s, a[10];
    scanf("%lld %lld %lld %lld %lld %lld", &n, &s, &a[0], &a[1], &a[2], &a[3]);
    n %= mod - 1;
    for (int j = 0; j < 4; j++) {
      sum = 0;
      for (int k = 0; k < 4; k++) {
        int cur = (4 - j * k % 4) % 4;
        sum = (sum + 1ll * w[cur] * quick_pow(1ll * s * w[k] % mod + 1, n) % mod) % mod;
      }
      ans = (ans + sum * a[j] % mod) % mod;
    }
    printf("%lld\n", ans * quick_pow(4, mod - 2) % mod);
  }
  return 0;
}

P5591 小猪佩奇学数学

$\sum_{i = 0} ^{n} (_i ^ n) \times p ^ i \times \lfloor \frac{i}{k} \rfloor\\ \lfloor \frac{i}{k} \rfloor = \frac{i - i \% k}{k}\\ \frac{1}{k} \sum_{i = 0} ^{n} (_i ^ n) \times p ^ i \times (i - i \% k)\\ \frac{1}{k} \sum_{i = 0} ^{n} (_i ^ n) \times p ^ i \times i - \frac{1}{k} \sum_{i = 0} ^{n} (_i ^ n) \times p ^ i (i \mod k)\\$
考虑前项化简：
$\frac{1}{k} \sum_{i = 0} ^{n} (_i ^ n) \times p ^ i \times i\\ \sum_{i = 0} ^{n} (_i ^ n) \times i = \sum_{i = 0} ^{n} \frac{n!}{i!(n - i)!} i = \sum_{i = 1} ^{n} \frac{n!}{(i - 1)!(n - i)!}\\ n\sum_{i = 1} ^{n} \frac{(n - 1)!}{(i - 1)!(n - i)!} = n \sum_{i = 1} ^{n} (_{i - 1} ^{n - 1})\\ 原式\frac{np}{k} \sum_{i = 1} ^{n} (_{i - 1} ^{n - 1}) p ^{i - 1} = \frac{np}{k} (p + 1) ^{n - 1}\\$
考虑后项化简：
$\frac{1}{k} \sum_{d = 0} ^{k - 1} d \sum_{i = 0} ^{n} (_i ^ n) p ^ i[k \mid i - d]\\ 对[k \mid i - d]进行单位根反演\\ \frac{1}{k} \sum_{d = 0} ^{k - 1} d \sum_{i = 0} ^{n} (_i ^ n) \times p ^ i \times \frac{1}{k} \sum_{j = 0} ^{k - 1} w_k ^{j(i- d)}\\ \frac{1}{k ^ 2}\sum_{d = 0} ^{k - 1} d \sum_{j = 0} ^{k - 1} w_{k} ^{-jd} \sum_{i = 0} ^{n} (_i ^ n) p ^ i w_{k} ^{ij}\\ \frac{1}{k ^ 2} \sum_{d = 0} ^{k - 1} d \sum_{j = 0} ^{k - 1} w_{k} ^{-jd} (pw_k ^{j} + 1) ^{n}\\ \frac{1}{k ^ 2} \sum_{j = 0} ^{k - 1} (p \times w_k ^ j + 1) ^n \sum_{d = 0} ^{k - 1} d \times w_{k} ^{-jd}\\$
$\sum\limits_{d = 0} ^{k - 1} d \times w_k ^{-jd}$ 形如 $\sum\limits_{i = 0} ^{n - 1} i r ^ i$ ，考虑形如 $\sum\limits_{i = 0} ^{n - 1} (i + 1) r ^ {i + 1}$ 这样的式子化简：
$\sum_{i = 0} ^{n - 1} (i + 1) r ^{i + 1} = r\sum_{i = 0} ^{n - 1} i r ^i + \sum_{i = 0} ^{n - 1} r ^{i + 1} = r \sum_{i = 0} ^{n - 1} i r ^ i + \frac{r(r ^ n - 1)}{r - 1}\\ 有\sum_{i = 0} ^{n - 1} i r ^ i = \sum_{i = 0} ^{n - 1} (i + 1) r ^{i + 1} - 0 r ^ 0 - n r ^ n\\ 所以\sum_{i = 0} ^{n - 1} i r ^ i = r \sum_{i = 0} ^{n - 1} i r ^ i + \frac{r(r ^ n - 1)}{r - 1} - n r ^ n\\ 整理可得\sum_{i = 0} ^{n - 1} i r ^ i = \frac{n r ^ n - \frac{r(r ^ n - 1)}{r - 1}}{r - 1} = \frac{n r ^ n(r - 1) - r (r ^ n - 1)}{(r - 1) ^ 2} = \frac{nr ^ n}{ r - 1} - \frac{r(r ^ n - 1)}{(r - 1) ^ 2}\\$
特殊情况 $r = 1$ 时 $\sum\limits_{i = 0} ^{n - 1} i r ^ i = \frac{n(n - 1)}{2}$ ，对后项再进行化简：
$\sum_{d = 0} ^{k - 1} d \times w _k ^{-jd}\\ 考虑j \neq 0时，也就是w_{k} ^{j}不为1\\ \sum_{d = 0} ^{k - 1} d \times w_k ^{-jd} = \frac{k w_k ^ {-jk}}{w_k ^{-j} - 1} - \frac{w_k ^{-j}(w_k ^{-jk} - 1)}{(w_k ^{-j} - 1) ^ 2} = \frac{k}{w_k ^{-j} - 1}\\ 后项整体有:\frac{1}{k ^ 2} \sum_{j = 0} ^{k - 1} (p \times w_k ^ j + 1) ^ n \frac{k}{w_k ^{-j} - 1}\\$
最后答案为：
$\frac{np}{k}(p + 1) ^ {n - 1} - \left(\frac{k(k - 1)}{2}\frac{(p + 1) ^ n}{k ^ 2} + \sum\limits_{j = 1} ^{k - 1} \frac{(p \times w_k ^ j + 1) ^ n}{k(w_{k} ^{-j} - 1)}\right)\\ \frac{np}{k}(p + 1) ^ {n - 1} - \left(\frac{(k - 1)(p + 1) ^ n}{2k} + \sum\limits_{j = 1} ^{k - 1} \frac{(p \times w_k ^ j + 1) ^ n}{k(w_{k} ^{-j} - 1)}\right)\\$

#include <bits/stdc++.h>

using namespace std;

const int mod = 998244353, N = 2e6 + 10;

int w[N], n, p, k;

int quick_pow(int a, int n) {
  int ans = 1;
  while (n) {
    if (n & 1) {
      ans = 1ll * ans * a % mod;
    }
    a = 1ll * a * a % mod;
    n >>= 1;
  }
  return ans;
}

int inv(int x) {
  return quick_pow(x, mod - 2);
}

int main() {
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  scanf("%d %d %d", &n, &p, &k);
  int wn = quick_pow(3, (mod - 1) / k);
  int ans = 1ll * n * p % mod * quick_pow(p + 1, n - 1) % mod * inv(k) % mod;
  int res = 1ll * (k - 1) * quick_pow(p + 1, n) % mod * inv(2 * k) % mod;
  w[0] = 1;
  for (int i = 1; i < k; i++) {
    w[i] = 1ll * w[i - 1] * wn % mod;
  }
  for (int i = 1; i < k; i++) {
    res = (res + 1ll * quick_pow(1ll * p * w[i] % mod + 1, n) * inv(1ll * k * (w[k - i] - 1) % mod) % mod) % mod;
  }
  ans = (ans - res + mod) % mod;
  printf("%d\n", ans);
  return 0;
}