solve for smallest n

1 files changed, 21 insertions, 0 deletions

diff --git a/exercises/1.2-3/main.go b/exercises/1.2-3/main.go
new file mode 100644
index 0000000..8abbbb9
--- /dev/null
+++ b/exercises/1.2-3/main.go
@@ -0,0 +1,21 @@
+package main
+
+import (
+	"fmt"
+	"math"
+)
+
+func main() {
+	fmt.Println("n,100n^2,2^n")
+
+	for n := 1.0; n < 100; n++ {
+		x := 100 * math.Pow(n, 2)
+		y := math.Pow(2, n)
+
+		fmt.Printf("%v,%v,%v\n", n, x, y)
+
+		if x < y {
+			break
+		}
+	}
+}