fix: repeated method name

Author: Rosander0

src/main/java/com/thealgorithms/maths/SociableNumber.java

@@ -1,4 +1,5 @@
 package com.thealgorithms.maths;
+// author: Vraj Prajapati @Rosander0
 
 /**
  * Sociable numbers are natural numbers that form a cyclic sequence where the
@@ -9,7 +10,6 @@
  *
  * @see <a href="https://en.wikipedia.org/wiki/Sociable_number">
  *     Wikipedia: Sociable Number</a>
- *
  * @see AmicableNumber
  */
 public final class SociableNumber {
@@ -18,13 +18,6 @@ private SociableNumber() {
         // Utility class
     }
 
-    /**
-     * Calculates the sum of proper divisors of a number
-     * (all divisors excluding the number itself).
-     *
-     * @param number the number to calculate proper divisors sum for
-     * @return sum of proper divisors, or 0 if number is less than or equal to 0
-     */
     static int sumOfProperDivisors(final int number) {
         if (number <= 0) {
             return 0;
@@ -40,24 +33,22 @@ static int sumOfProperDivisors(final int number) {
 
     /**
      * Checks whether a number is part of a sociable cycle of a given length.
-     * Starting from the given number, it follows the chain of proper divisor
-     * sums and checks if it returns to the starting number in exactly cycleLength steps.
      *
      * @param number the starting number (must be positive)
      * @param cycleLength the expected cycle length (must be greater than 1)
      * @return true if the number is part of a sociable cycle of given length, false otherwise
      */
-public static boolean isSociable(final int number, final int cycleLength) {
-    if (number <= 0 || cycleLength <= 1) {
-        return false;
-    }
-    int current = number;
-    for (int i = 0; i < cycleLength; i++) {
-        current = sumOfProperDivisors(current);
-        if (current == number) {
-            return i == cycleLength - 1;
+    public static boolean isSociable(final int number, final int cycleLength) {
+        if (number <= 0 || cycleLength <= 1) {
+            return false;
         }
-    }
-    return false;
+        int current = number;
+        for (int i = 0; i < cycleLength; i++) {
+            current = sumOfProperDivisors(current);
+            if (current == number) {
+                return i == cycleLength - 1;
+            }
+        }
+        return false;
     }
 }