{"request":{"endpoint":"https://exercism.org/api/v2/tracks/prolog/exercises/perfect-numbers/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"45b38222ea984ffaa899c67d386de34b","snippet":":- use_module(library(clpfd)). factors(1, []) :- !. factors(Number, [1|Factors]) :- MaxSmallFactor is floor(sqrt(Number)), findall(SmallFactor, (between(2, MaxSmallFactor, SmallFactor), Number mod SmallFactor =:= 0), SmallFactors), findall(BigFactor, (member(Factor, SmallFactors), BigFactor is Number // Factor, BigFactor < Number, BigFactor =\= Factor), BigFactors), append(SmallFactors, BigFactors, FactorsUnsorted), sort(FactorsUnsorted, Factors). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-27T12:58:40.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"ErikSchierboom"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/ErikSchierboom","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"e61977e9af60448e8701c18026504d4a","snippet":"%! classify(-Number, -Classification) is multi. classify(Number, Classification) :- between(1, inf, Number), aliquot_sum(Number, AliquotSum), ( Number == AliquotSum -> Classification = perfect ; Number < AliquotSum -> Classification = abundant ; Classification = deficient ). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-12T21:14:46.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"stellartux"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/stellartux","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"2fe8d51104424df5ade7dd4c8f0f5392","snippet":"classify(Number, Classification) :- factors_of(Number, Factors), sum_list(Factors, AliquotSum), classified_as(Number, AliquotSum, Classification). %classified_as(+Value, +AliquotSum, -Classification) classified_as(Value, Value, perfect). classified_as(Value, AliquotSum, abundant) :- AliquotSum > Value. classified_as(Value, AliquotSum, deficient) :- ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-06-13T14:23:40.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"AndrasLengyel"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/AndrasLengyel","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"680d01decc9a4b7b9def810d7f651ad1","snippet":"divmod(Dividend, Divisor, Quotient, Remainder) :- Quotient is Dividend div Divisor, Remainder is Dividend mod Divisor. sum_factors(1, 0). sum_factors(N, NumFactors) :- N > 1, sum_factors(N, 2, 1, NumFactors). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":48,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-09-14T04:39:13.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"ZennilGreenherald"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/ZennilGreenherald","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"4b45de232ba44cc6a9df2edf5674e7b5","snippet":"classify(Number, Classification) :- % classify/2: determine Classification for Number factors_of(Number, Factors), % compute list of proper divisors (Factors) of Number sum_list(Factors, AliquotSum), % sum those divisors to get the aliquot sum classified_as(Number, AliquotSum, Classification). % decide perfect/abundant/deficient from the sum %classified_as(+Value, +AliquotSum, -Classification) classified_as(Value, Value, perfect). % classified_as/3: if aliquot sum equals the value -> perfect classified_as(Value, AliquotSum, abundant) :- AliquotSum > Value. % if aliquot sum is greater than the value -> abundant classified_as(Value, AliquotSum, deficient) :- ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-10-10T09:53:14.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"JeroldAMernilo"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/JeroldAMernilo","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"703f182c50494433b71007029c100845","snippet":"% Classification: perfect, abundant, or deficient % Number classify(Number, Classification) :- integer(Number), Number > 0, findall(Cand, isAliquot(Number, Cand), Aliquots), sort(Aliquots, SortedAliquot), sum_list(SortedAliquot, AliquotSum), ( ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-08-25T03:36:25.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"mortalreminderpt"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/mortalreminderpt","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"1f07d43b15ed4344aa2f557d8a67f65f","snippet":"classify(Number, Classification) :- aliquot_sum(Number, Sum), classify(Number, Sum, Classification). aliquot_sum(Number, Sum) :- factors(Number, Factors), sumlist(Factors, Sum). factors(N, Factors) :- N > 0, UpperBound is N // 2, ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-09-29T18:05:38.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"blackk-foxx"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/blackk-foxx","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"21081e52689547ec9f3923e0bf34407b","snippet":"% perfect_numbers.pl % Classify numbers as perfect, abundant, or deficient based on aliquot sum. :- module(perfect_numbers, [classify/2]). classify(N, _) :- N =< 0, !, fail. ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":44,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-10-16T23:46:08.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"kenokabe"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/kenokabe","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"16b9c8f3ed514da09f9cc309c567e699","snippet":"% Classify a number classify(Number, Classification) :- integer(Number), Number > 0, % positive integers only aliquot_sum(Number, Sum), classify_by_sum(Number, Sum, Classification). % Reject non-positive integers classify(Number, _) :- ( \+ integer(Number) ; Number =< 0 ), !, fail. ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-11-18T00:08:42.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"enRook"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/enRook","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"54f8b6bc6a794641b42b68b96843f0dd","snippet":"classify(1, deficient). classify(Number, Classification) :- Number > 1, classify(Number, 2, 1, Classification). classify(N, I, S, C) :- divmod(N, I, Q, R), ( I > Q -> (S < N -> C = deficient; S > N -> C = abundant; C = perfect); (R =\= 0 -> T = S; I < Q -> T is S + I + Q; T is S + I), J is I + 1, classify(N, J, T, C)). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-17T18:45:16.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"anseok"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/anseok","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"4f5b55b4b8c14eb8b8307bc52401c7e7","snippet":" classify(Number, Classification) :- integer(Number), Number > 0, findall(Cand, isAliquot(Number, Cand), Aliquots), sort(Aliquots, SortedAliquot), sum_list(SortedAliquot, AliquotSum), ( Number =:= AliquotSum -> Classification = perfect ; AliquotSum > Number -> Classification = abundant ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-10-31T01:02:44.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"amelynlng"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/amelynlng","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"adeaf46d5fdd4e00afb32f40a75ed862","snippet":"% Classify a number as perfect, abundant, or deficient classify(N, Classification) :- N > 0, aliquot_sum(N, Sum), classify_type(N, Sum, Classification). % Determine classification based on comparison classify_type(N, Sum, perfect) :- N =:= Sum. classify_type(N, Sum, abundant) :- N < Sum. classify_type(N, Sum, deficient) :- N > Sum. ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-11-01T04:35:40.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"baniks2001"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/baniks2001","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"759fac4e113946f38a8af9ca7e3e33d4","snippet":"factor(Number, Factor) :- Limit is Number // 2, between(1, Limit, Factor), 0 =:= Number mod Factor. classify(Number, Classification) :- Number > 0, findall(Factor, factor(Number, Factor), Factors), sum_list(Factors, AliquotSum), Index is 1 + sign(Number - AliquotSum), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-02-09T13:33:45.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"gumminoppe"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/gumminoppe","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"b5a3a19e26494a0a9430e0e6fda6820f","snippet":"% For my Shree DR.MDD :- use_module(library(clpfd)). divisors(1, []) :- !. divisors(N, [1|Ds]) :- UpperBound is floor(sqrt(N)), findall(S, (between(2, UpperBound, S), N mod S =:= 0), SmallDivs), findall(L, (member(X, SmallDivs), L is N // X, L < N, L =\= X), LargeDivs), append(SmallDivs, LargeDivs, AllDivs), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-26T18:50:45.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"Rohankapri"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/Rohankapri","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"198a2eb2e68542c6a26ebae4e507a9b1","snippet":"% Calcula divisores propios (excluye el número mismo) divisores_propios(N, Divisores) :- N > 1, Limite is N // 2, findall(D, (between(1, Limite, D), N mod D =:= 0), Divisores). divisores_propios(1, []). % 1 no tiene divisores propios % Suma los elementos de una lista suma_lista([], 0). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":28,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-09T18:54:45.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"josealbertogutierrez1"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/josealbertogutierrez1","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"71b96ca50ee945d2aa84b5af9e0c7c1d","snippet":":- use_module(library(clpfd)). classify(Number, Classification) :- Number #> 0, factors(Number, Factors), sum_list(Factors, AliquotSum), classify(Number, AliquotSum, Classification). classify(Number, AliquotSum, Classification) :- compare(Order, AliquotSum, Number), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":30,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-04-13T06:41:02.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"jinwoo"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/jinwoo","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"3498ab67c91b418ba3c505312d9584f6","snippet":"classify(Number, _) :- Number =< 0, !, fail. classify(1, deficient) :- !. classify(Number, Classification) :- Number > 1, aliquot_sum(Number, Sum), ( Sum =:= Number -> Classification = perfect ; Sum > Number -> Classification = abundant ; Sum < Number -> Classification = deficient ). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-09-26T12:19:35.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"jolie25"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/jolie25","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"98cd03f426a24dd5bfd8fed1d38ad4ba","snippet":"classify(Number, Classification) :- Number > 0, divisor(1, Number, Tmp), exclude(=(Number), Tmp, Result), sumlist(Result, Sum), ( Sum = Number, Classification = perfect, !; Sum < Number, Classification = deficient, !; Classification = abundant ). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-02-21T07:04:35.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"liuq901"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/liuq901","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"e2da791d81194559b8bc23972f2d5eb4","snippet":"factors(1, _, []) :- !. factors(N, 1, [1]) :- !. factors(N, D, [D|Factors]) :- 0 is N mod D, !, DMinus1 is D - 1, factors(N, DMinus1, Factors). factors(N, D, Factors) :- DMinus1 is D - 1, factors(N, DMinus1, Factors). factors(N, Factors) :- ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-08-28T05:45:20.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"HitlerNaziGermany"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/HitlerNaziGermany","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"56aaa432e7d84157b553c4b399c84362","snippet":"factors(_, L, L, R, R). factors(N, I, L, R, Acc) :- divmod(N, I, J, M), add_factors(M, J, I, Acc, Acc1), I1 is I + 1, factors(N, I1, L, R, Acc1). add_factors(0, I, I, R, [I|R]). add_factors(0, J, I, R, [I,J|R]) :- J =\= I. add_factors(M, _, I, R, R) :- M =\= 0. ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":21,"iteration_status":"analyzing","published_iteration_head_tests_status":"exceptioned","published_at":"2024-12-11T06:09:33.000Z","is_out_of_date":true,"language":"prolog","author":{"handle":"dsletten"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/dsletten","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"7bbe2d8f60044593bc541ffc9a216bed","snippet":"% Calculate the aliquot sum of a number aliquot_sum(1, 0). aliquot_sum(N, Sum) :- Limit is floor(sqrt(N)), findall(F, (between(1, Limit, F), N mod F =:= 0), Factors), findall(F2, (member(F, Factors), F2 is N // F, F2 < N, F2 =\= F), Factors2), append([Factors, Factors2], FlatList), sort(FlatList, Divisors), sum_list(Divisors, Sum). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-21T20:00:24.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"kkweon"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/kkweon","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"b39a2d51b3cf4c3b82dc5269095fb1cc","snippet":"% classify(Number, Classification) classify(N, Classification) :- integer(N), N > 0, aliquot_sum(N, Sum), ( Sum =:= N -> Classification = perfect ; Sum > N -> Classification = abundant ; Sum < N -> Classification = deficient ). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-11-25T13:29:44.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"June-Lian"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/June-Lian","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"f1dd09a3b86b49e68b740a069befd3d4","snippet":"% Reject non-positive integers classify(Number, _) :- Number =< 0, !, fail. % Find all proper divisors (factors excluding the number itself) % For 1, there are no proper divisors proper_divisors(1, []) :- !. proper_divisors(N, Divisors) :- ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":53,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-11-13T07:14:11.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"lucifer1004"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/lucifer1004","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}},{"uuid":"a9dc431b9d7849aebe7423d3ede24777","snippet":"divides(A,B) :- A =\= 0, (B mod A) =:= 0. f_list(S,E,L) :- ( S > E // 2 -> L=[]; divides(S,E) -> L=[S|T], S1 is S+1, f_list(S1, E, T); S1 is S+1, f_list(S1, E, L)). factors(N,L):- ( N =:= 1 -> L=[]; N >= 2 -> f_list(1,N,L) ). ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-06T09:27:46.000Z","is_out_of_date":false,"language":"prolog","author":{"handle":"codebr3aker"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Prolog","icon_url":"https://assets.exercism.org/tracks/prolog.svg","highlightjs_language":"prolog"},"links":{"public_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/solutions/codebr3aker","private_iterations_url":"https://exercism.org/ar/tracks/prolog/exercises/perfect-numbers/iterations"}}],"meta":{"current_page":1,"total_count":24,"total_pages":1,"unscoped_total":24}}}}}

مسارات اللغات

تعلّم البرمجة مع Jiki

رحلتك

مفضلاتكجديد

مزايا Exercism

فيديوهات المجتمع

سلسلة المقدمات الموجزة

مقابلات وقصص

Discord

المنتدى

البدء

الإرشاد

الوثائق

المساهمون

المترجمونجديد

تبرّع

عن Exercism

أثرنا

مزامن GitHubجديد

Insiders