Cleaned up code via cursor.

Author: mikeckennedy

code/09-agentic-ai/math-research/math_research.ipynb

@@ -12,7 +12,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 1,
+   "execution_count": 4,
    "id": "6040bded7e982e0c",
    "metadata": {
     "ExecuteTime": {
@@ -29,6 +29,38 @@
     "import mathf"
    ]
   },
+  {
+   "cell_type": "raw",
+   "metadata": {
+    "vscode": {
+     "languageId": "raw"
+    }
+   },
+   "source": [
+    "## Understanding the Mathematical Problem\n",
+    "\n",
+    "### Fibonacci Numbers\n",
+    "The Fibonacci sequence is one of the most famous sequences in mathematics, where each number is the sum of the two preceding ones:\n",
+    "**1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...**\n",
+    "\n",
+    "### The Research Question\n",
+    "We're investigating an interesting mathematical relationship: **Which Fibonacci numbers are multiples of prime numbers?**\n",
+    "\n",
+    "Specifically, we want to explore:\n",
+    "- Given a prime number (like 17), which Fibonacci numbers are divisible by it?\n",
+    "- How large do these numbers get?\n",
+    "- Is there a pattern in their occurrence?\n",
+    "\n",
+    "### Why This Matters\n",
+    "This type of research helps us understand:\n",
+    "- **Number theory patterns**: How different mathematical sequences interact\n",
+    "- **Divisibility properties**: When and why certain relationships occur\n",
+    "- **Computational mathematics**: How to efficiently find these relationships\n",
+    "\n",
+    "### What We'll Discover\n",
+    "In the analysis below, we'll find the first 10 Fibonacci numbers that are multiples of 17, revealing how quickly these numbers grow and providing insight into the fascinating intersection of prime numbers and the Fibonacci sequence.\n"
+   ]
+  },
   {
    "cell_type": "markdown",
    "id": "9209940ceb5e46c0",
@@ -41,7 +73,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 2,
+   "execution_count": null,
    "id": "c8beeefbe98fd1b8",
    "metadata": {
     "ExecuteTime": {
@@ -51,15 +83,13 @@
    },
    "outputs": [],
    "source": [
+    "from itertools import islice\n",
+    "\n",
     "prime = 17\n",
     "all_fibs = mathf.fibonacci()\n",
-    "based_fibs = mathf.multiples_of(all_fibs, prime)\n",
+    "fib_multiples_of_prime = mathf.multiples_of(all_fibs, prime)\n",
     "\n",
-    "first_10 = []\n",
-    "for idx, fib in enumerate(based_fibs):\n",
-    "    first_10.append(fib)\n",
-    "    if idx > 10:\n",
-    "        break"
+    "first_10 = list(islice(fib_multiples_of_prime, 10))"
    ]
   },
   {
@@ -72,7 +102,7 @@
   },
   {
    "cell_type": "code",
-   "execution_count": 3,
+   "execution_count": 8,
    "id": "980daf7b8a4f2a61",
    "metadata": {
     "ExecuteTime": {
@@ -99,7 +129,12 @@
       "37,889,062,373,143,906\n",
       "2,880,067,194,370,816,120\n",
       "218,922,995,834,555,169,026\n",
-      "16,641,027,750,620,563,662,096\n"
+      "16,641,027,750,620,563,662,096\n",
+      "1,264,937,032,042,997,393,488,322\n",
+      "96,151,855,463,018,422,468,774,568\n",
+      "7,308,805,952,221,443,105,020,355,490\n",
+      "555,565,404,224,292,694,404,015,791,808\n",
+      "42,230,279,526,998,466,217,810,220,532,898\n"
      ]
     }
    ],
@@ -120,7 +155,7 @@
  ],
  "metadata": {
   "kernelspec": {
-   "display_name": "Python 3 (ipykernel)",
+   "display_name": "venv",
    "language": "python",
    "name": "python3"
   },

code/09-agentic-ai/math-research/mathf.py

@@ -1,14 +1,43 @@
-import typing
+from collections.abc import Generator, Iterable
 
 
-def fibonacci() -> typing.Generator[int, None, None]:
+def fibonacci() -> Generator[int, None, None]:
+    """Generate an infinite sequence of Fibonacci numbers.
+
+    Yields:
+        int: The next Fibonacci number in the sequence (1, 1, 2, 3, 5, 8, ...)
+
+    Example:
+        >>> fib = fibonacci()
+        >>> [next(fib) for _ in range(5)]
+        [1, 1, 2, 3, 5]
+    """
     current, nxt = 0, 1
     while True:
         current, nxt = nxt, nxt + current
         yield current
 
 
-def multiples_of(collection: typing.Iterable[int], number: int) -> typing.Generator[int, None, None]:
+def multiples_of(collection: Iterable[int], number: int) -> Generator[int, None, None]:
+    """Filter a collection to yield only multiples of a given number.
+
+    Args:
+        collection: An iterable of integers to filter
+        number: The number to find multiples of (must be positive)
+
+    Yields:
+        int: Numbers from the collection that are multiples of the given number
+
+    Raises:
+        ValueError: If number is not positive
+
+    Example:
+        >>> list(multiples_of([1, 2, 3, 4, 5, 6], 2))
+        [2, 4, 6]
+    """
+    if number <= 0:
+        raise ValueError('Number must be positive')
+
     for n in collection:
         if n % number == 0:
             yield n