PerfectNumber, PerfectNumberQ markdown

axkr · Oct 25, 2024 · 681980a · 681980a
1 parent e9a82e5
commit 681980a
Show file tree

Hide file tree

Showing 4 changed files with 4 additions and 8 deletions.
diff --git a/symja_android_library/doc/functions/PerfectNumber.md b/symja_android_library/doc/functions/PerfectNumber.md
@@ -4,8 +4,7 @@
 PerfectNumber(n)
 ```
 
-> returns the `n`th perfect number. In number theory, a perfect number is a positive integer that is equal to the sum of its proper 
-positive divisors, that is, the sum of its positive divisors excluding the number itself. Currently `0 <= n <= 47` can be computed, otherwise the function returns unevaluated.
+> returns the `n`th perfect number. In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself. 
 
 See
 * [Wikipedia - Perfect number](https://en.wikipedia.org/wiki/Perfect_number)

diff --git a/symja_android_library/doc/functions/PerfectNumberQ.md b/symja_android_library/doc/functions/PerfectNumberQ.md
@@ -4,8 +4,7 @@
 PerfectNumberQ(n)
 ```
 
-> returns `True` if `n` is a perfect number. In number theory, a perfect number is a positive integer that is equal to the sum of its proper 
-positive divisors, that is, the sum of its positive divisors excluding the number itself. 
+> returns `True` if `n` is a perfect number. In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself. 
 
 See
 * [Wikipedia - Perfect number](https://en.wikipedia.org/wiki/Perfect_number)

diff --git a/...roid_library/matheclipse-core/src/main/resources/doc/functions/PerfectNumber.md b/...roid_library/matheclipse-core/src/main/resources/doc/functions/PerfectNumber.md
@@ -4,8 +4,7 @@
 PerfectNumber(n)
 ```
 
-> returns the `n`th perfect number. In number theory, a perfect number is a positive integer that is equal to the sum of its proper 
-positive divisors, that is, the sum of its positive divisors excluding the number itself. Currently `0 <= n <= 47` can be computed, otherwise the function returns unevaluated.
+> returns the `n`th perfect number. In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself. 
 
 See
 * [Wikipedia - Perfect number](https://en.wikipedia.org/wiki/Perfect_number)

diff --git a/...oid_library/matheclipse-core/src/main/resources/doc/functions/PerfectNumberQ.md b/...oid_library/matheclipse-core/src/main/resources/doc/functions/PerfectNumberQ.md
@@ -4,8 +4,7 @@
 PerfectNumberQ(n)
 ```
 
-> returns `True` if `n` is a perfect number. In number theory, a perfect number is a positive integer that is equal to the sum of its proper 
-positive divisors, that is, the sum of its positive divisors excluding the number itself. 
+> returns `True` if `n` is a perfect number. In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself. 
 
 See
 * [Wikipedia - Perfect number](https://en.wikipedia.org/wiki/Perfect_number)