[newlib-cygwin] Fix 3 other instances of Reme typo (should be Remez)

[Jeff Johnston <jjohnstn@sourceware.org>]

https://sourceware.org/git/gitweb.cgi?p=newlib-cygwin.git;h=c8130c3fe8c7c662a94cd720bf62883bd628850f

commit c8130c3fe8c7c662a94cd720bf62883bd628850f
Author: Jeff Johnston <jjohnstn@redhat.com>
Date:   Fri Dec 16 14:18:56 2022 -0500

    Fix 3 other instances of Reme typo (should be Remez)

Diff:
---
 newlib/libm/common/s_expm1.c | 2 +-
 newlib/libm/common/s_log1p.c | 2 +-
 newlib/libm/math/e_log.c     | 2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/newlib/libm/common/s_expm1.c b/newlib/libm/common/s_expm1.c
index 10b0c8efb..51cdd2188 100644
--- a/newlib/libm/common/s_expm1.c
+++ b/newlib/libm/common/s_expm1.c
@@ -68,7 +68,7 @@ PORTABILITY
  *	    R1(r**2) = 6/r *((exp(r)+1)/(exp(r)-1) - 2/r)
  *		     = 6/r * ( 1 + 2.0*(1/(exp(r)-1) - 1/r))
  *		     = 1 - r^2/60 + r^4/2520 - r^6/100800 + ...
- *      We use a special Reme algorithm on [0,0.347] to generate 
+ *      We use a special Remez algorithm on [0,0.347] to generate 
  * 	a polynomial of degree 5 in r*r to approximate R1. The 
  *	maximum error of this polynomial approximation is bounded 
  *	by 2**-61. In other words,
diff --git a/newlib/libm/common/s_log1p.c b/newlib/libm/common/s_log1p.c
index c44461e8d..e3a3d9d9c 100644
--- a/newlib/libm/common/s_log1p.c
+++ b/newlib/libm/common/s_log1p.c
@@ -65,7 +65,7 @@ Interface Definition (Issue 2).
  *	Let s = f/(2+f) ; based on log(1+f) = log(1+s) - log(1-s)
  *		 = 2s + 2/3 s**3 + 2/5 s**5 + .....,
  *	     	 = 2s + s*R
- *      We use a special Reme algorithm on [0,0.1716] to generate 
+ *      We use a special Remez algorithm on [0,0.1716] to generate 
  * 	a polynomial of degree 14 to approximate R The maximum error 
  *	of this polynomial approximation is bounded by 2**-58.45. In
  *	other words,
diff --git a/newlib/libm/math/e_log.c b/newlib/libm/math/e_log.c
index ac4a95068..461ae0309 100644
--- a/newlib/libm/math/e_log.c
+++ b/newlib/libm/math/e_log.c
@@ -23,7 +23,7 @@
  *	Let s = f/(2+f) ; based on log(1+f) = log(1+s) - log(1-s)
  *		 = 2s + 2/3 s**3 + 2/5 s**5 + .....,
  *	     	 = 2s + s*R
- *      We use a special Reme algorithm on [0,0.1716] to generate 
+ *      We use a special Remez algorithm on [0,0.1716] to generate 
  * 	a polynomial of degree 14 to approximate R The maximum error 
  *	of this polynomial approximation is bounded by 2**-58.45. In
  *	other words,