23: non-abundant sums

05_smallest_multiple/main.go

@@ -5,7 +5,7 @@ import "fmt"
 func main() {
 	n := 20
 	for {
-		if IsDivisibleFor1to20(n) {
+		if IsDivisible(1, 20, n) {
 			fmt.Println("evenly divisible by all of the numbers from 1 to 20:", n)
 			return
 		}
@@ -13,8 +13,8 @@ func main() {
 	}
 }
 
-func IsDivisibleFor1to20(n int) bool {
-	for i := 1; i <= 20; i++ {
+func IsDivisible(start, end, n int) bool {
+	for i := start; i <= end; i++ {
 		if n%i != 0 {
 			return false
 		}

05_smallest_multiple/smallest_multiple_test.go

@@ -2,19 +2,39 @@ package main
 
 import "testing"
 
-func TestIsDivisibleFor1to20(t *testing.T) {
+func Test_isDivisible(t *testing.T) {
 	tt := []struct {
 		name  string
+		start int
+		end   int
 		input int
 		want  bool
 	}{
+		{
+			"2",
+			1,
+			2,
+			2,
+			true,
+		},
+		{
+			"10",
+			1,
+			10,
+			2520,
+			true,
+		},
 		{
 			"20",
+			1,
+			20,
 			20,
 			false,
 		},
 		{
 			"14",
+			1,
+			20,
 			14,
 			false,
 		},
@@ -22,9 +42,9 @@ func TestIsDivisibleFor1to20(t *testing.T) {
 
 	for _, tc := range tt {
 		t.Run(tc.name, func(t *testing.T) {
-			got := IsDivisibleFor1to20(tc.input)
+			got := IsDivisible(tc.start, tc.end, tc.input)
 			if got != tc.want {
-				t.Errorf("IsDivisibleFor1to20(%d)=%v, want %v", tc.input, got, tc.want)
+				t.Errorf("IsDivisible(%d)=%v, want %v", tc.input, got, tc.want)
 			}
 		})
 	}