Messages are listed by thread. The last update was on 20:04 GMT Fri Jun 30. There are 107 messages.
[Date Index] [Other Lists] [Home]

• What is ".:~:~/gp" on Macintosh Mac OS System? Jean-Luc ARNAUD
  • Re: What is ".:~:~/gp" on Macintosh Mac OS System? Ruud H.G. van Tol
    • Re: What is ".:~:~/gp" on Macintosh Mac OS System? Jean-Luc Arnaud
• Abnormous memory use for gaussian gcd()? hermann
  • Re: Abnormous memory use for gaussian gcd()? Bill Allombert
    • Re: Abnormous memory use for gaussian gcd()? hermann
      • Re: Abnormous memory use for gaussian gcd()? hermann
      • Re: Abnormous memory use for gaussian gcd()? Bill Allombert
      • Re: Abnormous memory use for gaussian gcd()? hermann
      • Re: Abnormous memory use for gaussian gcd()? Bill Allombert
      • Re: Abnormous memory use for gaussian gcd()? Bill Allombert
      • Re: Abnormous memory use for gaussian gcd()? hermann
      • Re: Abnormous memory use for gaussian gcd()? Bill Allombert
      • Re: Abnormous memory use for gaussian gcd()? hermann
      • Re: Abnormous memory use for gaussian gcd()? hermann
      • Re: Abnormous memory use for gaussian gcd()? Bill Allombert
      • Re: Abnormous memory use for gaussian gcd()? Karim Belabas
      • Re: Abnormous memory use for gaussian gcd()? hermann
      • Re: Abnormous memory use for gaussian gcd()? Bill Allombert
      • Re: Abnormous memory use for gaussian gcd()? hermann
      • Re: Abnormous memory use for gaussian gcd()? hermann
• Different behavior in library mode (PARI) vs. in GP (when using Z_issmooth) Daniel Berger
  • Re: Different behavior in library mode (PARI) vs. in GP (when using Z_issmooth) Karim Belabas
  • Re: Different behavior in library mode (PARI) vs. in GP (when using Z_issmooth) Bill Allombert
• Help evaluating a logarithmic integral kevin lucas
  • Re: Help evaluating a logarithmic integral Alessandro Languasco
    • Re: Help evaluating a logarithmic integral Loïc Grenié
      • Re: Help evaluating a logarithmic integral kevin lucas
      • Re: Help evaluating a logarithmic integral Loïc Grenié
      • Re: Help evaluating a logarithmic integral Bill Allombert
• Issue with fullfactor Jean-Luc ARNAUD
  • Re: Issue with fullfactor Max Alekseyev
  • Re: Issue with fullfactor Bill Allombert
    • Re: Issue with fullfactor Jean-Luc Arnaud
      • Re: Issue with fullfactor Bill Allombert
• Pari/GP "halfgcd()" implementation hermann
  • Re: Pari/GP "halfgcd()" implementation Vincent Delecroix
    • Re: Pari/GP "halfgcd()" implementation hermann
  • Re: Pari/GP "halfgcd()" implementation Bill Allombert
    • Re: Pari/GP "halfgcd()" implementation hermann
• efficient determination of smallest quadratic non-residue / t++ works, t=nextprime(t) hangs hermann
  • Re: efficient determination of smallest quadratic non-residue / t++ works, t=nextprime(t) hangs Max Alekseyev
    • Re: efficient determination of smallest quadratic non-residue / t++ works, t=nextprime(t) hangs hermann
  • Re: efficient determination of smallest quadratic non-residue / t++ works, t=nextprime(t) hangs Bill Allombert
    • Re: efficient determination of smallest quadratic non-residue / t++ works, t=nextprime(t) hangs hermann
• 388342-digit largest known twin prime: faster sum of squares or sqrt(-1) (mod p) ? hermann
  • Re: 388342-digit largest known twin prime: faster sum of squares or sqrt(-1) (mod p) ? hermann
    • Re: 388342-digit largest known twin prime: faster sum of squares or sqrt(-1) (mod p) ? Bill Allombert
• Problème avec intnum Damian Rössler
  • Re: Problème avec intnum Bill Allombert
    • Re: Problème avec intnum Damian Rossler
      • Re: Problème avec intnum Pascal Molin
      • Re: Problème avec intnum Damian Rössler
      • Re: Problème avec intnum Bill Allombert
      • Re: Problème avec intnum Damian Rössler
• Why is "x*Mod(1/y, p)" 28.7% faster than "Mod(x/y, p)" ? hermann
  • Re: Why is "x*Mod(1/y, p)" 28.7% faster than "Mod(x/y, p)" ? Karim Belabas
• How to best dynamically make use of cypari2? hermann
  • Re: How to best dynamically make use of cypari2? Vincent Delecroix
    • Re: How to best dynamically make use of cypari2? hermann
      • Re: How to best dynamically make use of cypari2? hermann
• PariDroid questions hermann
  • Re: PariDroid questions Andreas Enge
    • Re: PariDroid questions hermann
• void mpz_set_GEN(mpz_ptr z, GEN x) and GEN mpz_get_GEN(mpz_srcptr z) hermann
  • Re: void mpz_set_GEN(mpz_ptr z, GEN x) and GEN mpz_get_GEN(mpz_srcptr z) Max Alekseyev
    • Re: void mpz_set_GEN(mpz_ptr z, GEN x) and GEN mpz_get_GEN(mpz_srcptr z) hermann
      • Re: void mpz_set_GEN(mpz_ptr z, GEN x) and GEN mpz_get_GEN(mpz_srcptr z) hermann
      • Re: void mpz_set_GEN(mpz_ptr z, GEN x) and GEN mpz_get_GEN(mpz_srcptr z) hermann
  • Re: void mpz_set_GEN(mpz_ptr z, GEN x) and GEN mpz_get_GEN(mpz_srcptr z) Andreas Enge
    • Re: void mpz_set_GEN(mpz_ptr z, GEN x) and GEN mpz_get_GEN(mpz_srcptr z) hermann
• Parallel Processing of subsets Daniel Berger
  • Re: Parallel Processing of subsets Loïc Grenié
  • Re: Parallel Processing of subsets Bill Allombert
• efficient transformations between "sum of squares" and "sqrt(-1) (mod p)" for 1M-digit prime hermann
• How to compute "Mod(2^(n+1), n)" for very big n? hermann
  • Re: How to compute "Mod(2^(n+1), n)" for very big n? Andreas Enge
    • Re: How to compute "Mod(2^(n+1), n)" for very big n? hermann
      • Re: How to compute "Mod(2^(n+1), n)" for very big n? Bill Allombert
      • Re: How to compute "Mod(2^(n+1), n)" for very big n? hermann
      • Re: How to compute "Mod(2^(n+1), n)" for very big n? hermann
      • Re: How to compute "Mod(2^(n+1), n)" for very big n? hermann
      • Re: How to compute "Mod(2^(n+1), n)" for very big n? Bill Allombert
  • Re: How to compute "Mod(2^(n+1), n)" for very big n? Bill Allombert
• New syntax of strslice Jean-Luc ARNAUD
  • Re: New syntax of strslice hermann
  • Re: New syntax of strslice Aurel Page
    • Re: New syntax of strslice hermann
      • Re: New syntax of strslice Karim Belabas
    • Re: New syntax of strslice Jean-Luc ARNAUD
  • Re: New syntax of strslice Bill Allombert
• Why is "lift(Mod(qnr, n)^(n\4))" 16% slower than C libgmp "powm(r, qnr, n/4, n)" ? hermann
  • Re: Why is "lift(Mod(qnr, n)^(n\4))" 16% slower than C libgmp "powm(r, qnr, n/4, n)" ? Karim Belabas
    • Re: Why is "lift(Mod(qnr, n)^(n\4))" 16% slower than C libgmp "powm(r, qnr, n/4, n)" ? hermann
  • Re: Why is "lift(Mod(qnr, n)^(n\4))" 16% slower than C libgmp "powm(r, qnr, n/4, n)" ? Bill Allombert
• gp-2.15.3 compiled on Ubuntu on AMD 7600X very slow compared to i7 (many page faults), Win11 gp-2.15.3 on 7600X better than i7. How to fix AMD Ubuntu? hermann
  • Re: gp-2.15.3 compiled on Ubuntu on AMD 7600X very slow compared to i7 (many page faults), Win11 gp-2.15.3 on 7600X better than i7. How to fix AMD Ubuntu? Bill Allombert
    • Re: gp-2.15.3 compiled on Ubuntu on AMD 7600X very slow compared to i7 (many page faults), Win11 gp-2.15.3 on 7600X better than i7. How to fix AMD Ubuntu? hermann
      • Re: gp-2.15.3 compiled on Ubuntu on AMD 7600X very slow compared to i7 (many page faults), Win11 gp-2.15.3 on 7600X better than i7. How to fix AMD Ubuntu? Bill Allombert
      • Re: gp-2.15.3 compiled on Ubuntu on AMD 7600X very slow compared to i7 (many page faults), Win11 gp-2.15.3 on 7600X better than i7. How to fix AMD Ubuntu? hermann
• Can PARI code be forced to run in 32MB L3 cache, mostly without RAM? hermann
  • Re: Can PARI code be forced to run in 32MB L3 cache, mostly without RAM? hermann
• How to interrupt a MT calculation? Jean-Luc ARNAUD
  • Re: How to interrupt a MT calculation? Bill Allombert
    • Re: How to interrupt a MT calculation? Jean-Luc Arnaud
      • Re: How to interrupt a MT calculation? Max Alekseyev
      • Re: How to interrupt a MT calculation? Bill Allombert