From c8f5f74bb3ba0213a840069c7c643d0e5c73db8e Mon Sep 17 00:00:00 2001
From: "R. Tyler Croy" <tyler@monkeypox.org>
Date: Sun, 13 Mar 2011 21:18:41 -0700
Subject: [PATCH] Add solution to problem seven

---
 seven.adb | 43 +++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 seven.adb

diff --git a/seven.adb b/seven.adb
new file mode 100644
index 0000000..e45a465
--- /dev/null
+++ b/seven.adb
@@ -0,0 +1,43 @@
+--
+--  Project Euler problem #7
+--
+--  By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see
+--  that the 6th prime is 13.
+--
+--  What is the 10001st prime number?
+--
+
+with Ada.Numerics.Elementary_Functions,
+     Ada.Text_IO;
+
+use Ada.Numerics.Elementary_Functions,
+    Ada.Text_IO;
+
+procedure Seven is
+
+    function Is_Prime (Input : in Natural) return Boolean is
+        -- Using the "Trial Division" method detailed in this Wikipedia entry:
+        -- https://secure.wikimedia.org/wikipedia/en/wiki/Prime_number#Trial_division
+        Ceiling : constant Natural := Natural (Sqrt (Float (Input)));
+    begin
+        for Index in 2 .. Ceiling loop
+            if (Input mod Index) = 0 then
+                return false;
+            end if;
+        end loop;
+        return true;
+    end Is_Prime;
+
+    Count : Natural := 0;
+begin
+    for N in 2 .. Natural'Last loop
+        if Is_Prime (N) then
+            Count := (Count + 1);
+
+            if Count = 10_001 then
+                Put_Line (Natural'Image (N) & " is prime");
+                return;
+            end if;
+        end if;
+    end loop;
+end Seven;