# HG changeset patch
# User Kai T. Ohlhus <k.ohlhus@gmail.com>
# Date 1634092003 -32400
# Node ID 72b6b886b9d01214abac3e0b298933c0a8ef6d6a
# Parent  2b74543c85ead80bca7c674c21dbb67b6237bfa9
doc: rephrase NEWS about factor-function speedup (bug #61129).

* NEWS: rephrase file about factor-function speedup.

diff -r 2b74543c85ea -r 72b6b886b9d0 NEWS
--- a/NEWS	Tue Oct 12 08:46:56 2021 +0200
+++ b/NEWS	Wed Oct 13 11:26:43 2021 +0900
@@ -76,11 +76,8 @@
 same number of digits for each value such as
 `[0x00_00_01; 0x00_01_00; 0x01_00_00]`.
 
-- The `factor` function has been overhauled for speed.  Especially, for
-large input quantities (> 1e14) with small prime factors, e.g.
-`intmax ("uint64")`, the function can be up to 10,000 times faster.
-However, for large input quantities with large prime factors, the function
-can be up to 4x faster.
+- The `factor` function has been overhauled for speed.  For large
+composite numbers > 1e14, it can be up to 10,000 times faster.
 
 - The `mldivide` function (i.e., the `\` operator) now uses an LU
 decomposition to solve nearly singular full square matrices.  This is