mirror of
https://github.com/vale981/arb
synced 2025-03-06 09:51:39 -05:00
f488a8b034
- split files, one for each function - use acb_dirichlet prefix everywhere - distinguish pairing / character value + fix bug on exponent
56 lines
1.6 KiB
C
56 lines
1.6 KiB
C
/*=============================================================================
|
|
|
|
This file is part of ARB.
|
|
|
|
ARB is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ARB is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with ARB; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
=============================================================================*/
|
|
/******************************************************************************
|
|
|
|
Copyright (C) 2016 Pascal Molin
|
|
|
|
******************************************************************************/
|
|
|
|
#include "acb_dirichlet.h"
|
|
|
|
/* sieve on primes */
|
|
void
|
|
acb_dirichlet_chi_vec_sieve(ulong *v, ulong nv, const acb_dirichlet_group_t G, const acb_dirichlet_char_t chi)
|
|
{
|
|
ulong k, p, pmax;
|
|
n_primes_t iter;
|
|
|
|
n_primes_init(iter);
|
|
|
|
pmax = (nv < G->q) ? nv : G->q;
|
|
v[1] = 0;
|
|
while ((p = n_primes_next(iter)) < pmax)
|
|
{
|
|
if (G->q % p == 0)
|
|
{
|
|
for (k = p; k < nv; k += p)
|
|
v[k] = CHI_NULL;
|
|
}
|
|
else
|
|
{
|
|
long chip;
|
|
chip = acb_dirichlet_chi(G, chi, p);
|
|
for (k = p; k < nv; k += p)
|
|
if (v[k] != -1)
|
|
v[k] = (v[k] + chip) % chi->order;
|
|
}
|
|
}
|
|
n_primes_clear(iter);
|
|
}
|