diff --git a/en/Basic Math/Aliquot_Sum.md b/en/Basic Math/Aliquot_Sum.md
index 88e8c998..2f282440 100644
--- a/en/Basic Math/Aliquot_Sum.md	
+++ b/en/Basic Math/Aliquot_Sum.md	
@@ -34,12 +34,8 @@ The reason we take the upper bound as $[\frac{n} 2]$ is that, the largest possib
 The sum which we obtain is the aliquot sum of the number
 
 ## Implementations
-- [C#](https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Numeric/AliquotSumCalculator.cs)
-- [Java](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/maths/AliquotSum.java)
-- [JavaScript](https://github.com/TheAlgorithms/JavaScript/blob/master/Maths/AliquotSum.js)
-- [Python](https://github.com/TheAlgorithms/Python/blob/master/maths/aliquot_sum.py)
-- [Ruby](https://github.com/TheAlgorithms/Ruby/blob/master/maths/aliquot_sum.rb)
+- [TheAlgorithms](https://the-algorithms.com/algorithm/aliquot-sum)
 
 ## Sources
 - [Wikipedia](https://en.wikipedia.org/wiki/Aliquot_sum)
-- [GeeksForGeeks](https://www.geeksforgeeks.org/aliquot-sum/)
\ No newline at end of file
+- [GeeksForGeeks](https://www.geeksforgeeks.org/aliquot-sum/)