/usr/include/eclib/mlocsol.h is in libec-dev 20160720-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 | // mlocsol.h: declaration of functions for local solubility of quartics
//////////////////////////////////////////////////////////////////////////
//
// Copyright 1990-2012 John Cremona
//
// This file is part of the eclib package.
//
// eclib 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.
//
// eclib 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 eclib; if not, write to the Free Software Foundation,
// Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
//
//////////////////////////////////////////////////////////////////////////
#include "mquartic.h"
// Checks for solublility in Qp:
int qpsoluble(const quartic& g, const bigint& p);
int qpsoluble(const bigint& a, const bigint& b, const bigint& c, const bigint& d,
const bigint& e, const bigint& p);
int qpsoluble(const bigint& a, const bigint& c, const bigint& e, const bigint& p);
// latter assumes b=d=0
int Rsoluble(const quartic& g);
int Rsoluble(const bigint& a, const bigint& b, const bigint& c, const bigint& d,
const bigint& e);
// Checks for local solubility in Qp for all p in plist;
//if not, badp will hold the first p for which NOT soluble in Qp:
int locallysoluble(const quartic& g, const vector<bigint>& plist, bigint& badp);
int locallysoluble(const bigint& a, const bigint& b, const bigint& c, const bigint& d,
const bigint& e, const vector<bigint>& plist, bigint& badp);
int locallysoluble(const bigint& a, const bigint& c, const bigint& e,
const vector<bigint>& plist, bigint& badp);
// latter assumes b=d=0
/* Samir Siksek's Local Solubility Test for odd p */
int local_sol(const bigint& p,bigint *c, int verbose=0);
// Checks for solublility in Qp
int new_qpsoluble(const quartic& g, const bigint& p, int verbose=0);
int new_qpsoluble(const bigint& a, const bigint& b, const bigint& c,
const bigint& d, const bigint& e,
const bigint& p, int verbose=0);
int new_qpsoluble(const bigint& a, const bigint& c, const bigint& e,
const bigint& p, int verbose=0);
int new_zpsol(const bigint& a,const bigint& b,const bigint& c,const bigint& d,
const bigint& e, const bigint& p, int verbose=0);
|