1 /* It makes the linear solver non-verbose */
2 /* This is an external option used by the linear solver */
6 /* ---------------------------------------------------------------------- */
7 /* Maximum order of the recurrence equation searched in Zeilberger's alg. */
11 /* --------------------------------------------------------------------- */
13 /* Constant values used to set output_format */
14 simplified_output : false;
17 /* --------------------------------------------------------------------- */
19 /* We are assuming that the independent variables in the solutions */
20 /* produced by the linear solver are stored in ind_vars(linear_solver) */
21 linear_solver : linsolve;
24 /* --------------------------------------------------------------------- */
25 /* Numerical test through evaluation and modular computation */
26 /* Numerical test flag */
29 /* Modular linear solver */
30 modular_linear_solver : linsolve;
32 /* Evaluation point used before modular_linear_solver */
33 ev_point : big_primes[10];
35 /* Big prime taken as the modulo in modular_linear_solver */
36 mod_big_prime : big_primes[1];
38 /* Heuristic threshold for the modular approach */
39 /* The modular test is not performed above this order */
45 /* Gosper tried as first attempt */
46 Gosper_in_Zeilberger : true;
48 /* Trivial solutions flag */
49 /* When it is set to false solutions with zero certificate or */
50 /* with all coefficients identically zero are excluded */
51 trivial_solutions : true;
53 /* Level of details in "gs_prove" */
54 gs_prove_detail : PROOF_MEDIUM;
56 /* Level of details in "zb_prove" and "zb_test" */
57 zb_prove_detail : PROOF_MEDIUM;