🎉 Exercism Research is now launched. Help Exercism, help science and have some fun at research.exercism.io 🎉 # masters3d's solution

## to Perfect Numbers in the Objective-C Track

Published at Jul 13 2018 · 0 comments
Instructions
Test suite
Solution

Determine if a number is perfect, abundant, or deficient based on Nicomachus' (60 - 120 CE) classification scheme for natural numbers.

The Greek mathematician Nicomachus devised a classification scheme for natural numbers, identifying each as belonging uniquely to the categories of perfect, abundant, or deficient based on their aliquot sum. The aliquot sum is defined as the sum of the factors of a number not including the number itself. For example, the aliquot sum of 15 is (1 + 3 + 5) = 9

• Perfect: aliquot sum = number
• 6 is a perfect number because (1 + 2 + 3) = 6
• 28 is a perfect number because (1 + 2 + 4 + 7 + 14) = 28
• Abundant: aliquot sum > number
• 12 is an abundant number because (1 + 2 + 3 + 4 + 6) = 16
• 24 is an abundant number because (1 + 2 + 3 + 4 + 6 + 8 + 12) = 36
• Deficient: aliquot sum < number
• 8 is a deficient number because (1 + 2 + 4) = 7
• Prime numbers are deficient

Implement a way to determine whether a given number is perfect. Depending on your language track, you may also need to implement a way to determine whether a given number is abundant or deficient.

## Setup

There are two different methods of getting set up to run the tests with Objective-C:

• Create an Xcode project with a test target which will run the tests.
• Use the ruby gem `objc` as a test runner utility.

Both are described in more detail here: http://exercism.io/languages/objective-c

### Submitting Exercises

When submitting an exercise, make sure your solution file is in the same directory as the test code.

The submit command will look something like:

``````exercism submit <path-to-exercism-workspace>/objective-c/perfect-numbers/PerfectNumbers.m
``````

You can find the Exercism workspace by running `exercism debug` and looking for the line beginning with Workspace.

## Source

Taken from Chapter 2 of Functional Thinking by Neal Ford. http://shop.oreilly.com/product/0636920029687.do

## Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.

### PerfectNumbersTest.m

``````#import <XCTest/XCTest.h>

#if __has_include("PerfectNumbersExample.h")
# import "PerfectNumbersExample.h"
# else
# import "PerfectNumbers.h"
#endif

NS_ASSUME_NONNULL_BEGIN

@interface PerfectNumbersTest : XCTestCase

@end

@implementation PerfectNumbersTest

- (void)testPerfect {
NumberClassifier *numberClassifier = [[NumberClassifier alloc] initWithNumber:6];
NumberClassification expectedValue = NumberClassificationPerfect;
NumberClassification result = [numberClassifier classification];
XCTAssertEqual(result, expectedValue);
}

- (void)testPerfectAgain {
NumberClassifier *numberClassifier = [[NumberClassifier alloc] initWithNumber:28];
NumberClassification expectedValue = NumberClassificationPerfect;
NumberClassification result = [numberClassifier classification];
XCTAssertEqual(result, expectedValue);
}

- (void)testDeficient {
NumberClassifier *numberClassifier = [[NumberClassifier alloc] initWithNumber:13];
NumberClassification expectedValue = NumberClassificationDeficient;
NumberClassification result = [numberClassifier classification];
XCTAssertEqual(result, expectedValue);
}

- (void)testAbundant {
NumberClassifier *numberClassifier = [[NumberClassifier alloc] initWithNumber:12];
NumberClassification expectedValue = NumberClassificationAbundant;
NumberClassification result = [numberClassifier classification];
XCTAssertEqual(result, expectedValue);
}

@end
NS_ASSUME_NONNULL_END``````
``````//
//  PerfectNumbers.m
//  exercismObjc
//
//  Created by Cheyo Jimenez on 4/10/16.
//  Copyright © 2016 Cheyo Jimenez. All rights reserved.
//

#import "PerfectNumbers.h"

@interface NumberClassifier()
+(int)sum:(int)factorsNumber;
@property int number;
@end

@implementation NumberClassifier

+(int)sum:(int)factorsNumber{
int total  = 0;
for (int i = 1; i < factorsNumber; i++) {
if ((factorsNumber % i) == 0) {
total = total + i;
}
}
return total;
}

-(id)initWithNumber:(int) input {
self.number = input;
return self;
}

-(NumberClassification) classification {

int result = [NumberClassifier sum: self.number];

if ( result == self.number) { return  NumberClassificationPerfect;}
if ( result >  self.number) { return  NumberClassificationAbundant;}
if ( result <  self.number) { return  NumberClassificationDeficient;}

return NumberClassificationNone;

}

@end``````

## Community comments

Find this solution interesting? Ask the author a question to learn more.

### What can you learn from this solution?

A huge amount can be learned from reading other people’s code. This is why we wanted to give exercism users the option of making their solutions public.

Here are some questions to help you reflect on this solution and learn the most from it.

• What compromises have been made?
• Are there new concepts here that you could read more about to improve your understanding?