diff --git a/Source/FastMathFunctions/arm_cos_f32.c b/Source/FastMathFunctions/arm_cos_f32.c
index 0756c575..fa408c8b 100644
--- a/Source/FastMathFunctions/arm_cos_f32.c
+++ b/Source/FastMathFunctions/arm_cos_f32.c
@@ -44,7 +44,7 @@
   [0 +0.9999] mapping to [0 2*pi).  The fixed-point range is chosen so that a
   value of 2*pi wraps around to 0.
 
-  The implementation is based on table lookup using 256 values together with linear interpolation.
+  The implementation is based on table lookup using 512 values together with linear interpolation.
   The steps used are:
    -# Calculation of the nearest integer table index
    -# Compute the fractional portion (fract) of the table index.
diff --git a/Source/FastMathFunctions/arm_sin_f32.c b/Source/FastMathFunctions/arm_sin_f32.c
index 610cb2ef..0d23aa0f 100644
--- a/Source/FastMathFunctions/arm_sin_f32.c
+++ b/Source/FastMathFunctions/arm_sin_f32.c
@@ -44,7 +44,7 @@
   [0 +0.9999] mapping to [0 2*pi).  The fixed-point range is chosen so that a
   value of 2*pi wraps around to 0.
 
-  The implementation is based on table lookup using 256 values together with linear interpolation.
+  The implementation is based on table lookup using 512 values together with linear interpolation.
   The steps used are:
    -# Calculation of the nearest integer table index
    -# Compute the fractional portion (fract) of the table index.