- 01Getting Started
- 02Your First Output (puts)
- 03Working with Variables
- 04Conditionals (if statements)
- 05Loops
- 06Writing a Method (Function)
- 07Working with Arrays
- 08Loops (while statements)
- 09Classes (Object-Oriented Programming)
- 10Error Handling (begin...rescue)
- 11Handy Array Methods
- 12Recursive Functions
- 13Using the Standard Library
- 14The case/when Statement
- 15The Ternary Operator
- 16Inheritance (Extending a Class)
- 17Writing Comments
- 18Logical Operators (AND, OR, NOT)
- 19Constants (names starting with a capital)
- 20Splitting and Joining Strings (split, join)
- 21Writing nil-Safe Code
- 22Searching an Array (include?)
- 23Transforming an Array (map)
- 24Two-Dimensional Arrays (Tabular Data)
- 25Writing a Custom Exception Class
- 26Default Parameter Values
- 27Working with Set
- 28Testing with Your Own assert Method
- 29Higher-Order Functions (Passing a Block)
- 30Stacks and Queues (Basic Data Structures)
- 31Type Conversion (Casting) Basics
- 32Intro to Regular Expressions (Pattern Matching)
- 33The Binary Search Algorithm
- 34Building a Caesar Cipher (a Character-Shifting Cipher)
- 35Understanding How Bubble Sort Works
- 36Building and Displaying Dates (Basic Year/Month/Day Operations)
- 37Writing Multiple Test Cases Together
- 38Speeding Up Calculations with Memoization (Caching)
- 39Normalizing Strings (strip, Unifying Case)
- 40Shallow Copy vs. Deep Copy
- 41Enum Basics
- 42Flattening an Array
- 43Reversing a String and Checking for Palindromes
- 44Pairing Up Two Arrays (the zip operation)
- 45Rounding Numbers (floor, ceil, round)
- 46Multi-Line Strings (Heredoc)
- 47Methods That Return Multiple Values
- 48Finding the GCD and LCM
- 49Formatting Numbers (Padding Digits, Decimal Places)
- 50Cleanup Logic with begin/rescue/ensure
- 51Methods That Work with Any Type
- 52File Reading and Writing Basics
- 53Generating Random Numbers
- 54Bitwise Operators (AND, OR, XOR, shifts)
- 55Reading Command-Line Arguments
- 56Waiting for a Fixed Amount of Time (sleep)
- 57Watch Out for Floating-Point Rounding Errors
- 58Reading from Standard Input
- 59FizzBuzz (the Classic Practice Problem)
- 60Checking Whether a Number Is Prime
- 61Set Operations with Set (Union, Intersection, Difference)
- 62Converting Number Bases (Binary, Hex)
- 63Checking Balanced Parentheses (an Application of Stacks)
- 64Checking Whether Two Words Are Anagrams
- 65Checking Whether a Year Is a Leap Year
- 66Converting Temperature (Celsius to Fahrenheit)
- 67Prime Factorization
- 68[Applied] Build a Simple Inventory Management Tool
Prime Factorization
In this lesson you will learn the prime factorization algorithm - expressing a number as a product of primes - and see mathematics and programming meet. This is for anyone searching for "Ruby prime factorization".
Prime factorization means expressing a number as a product of primes. Try dividing by 2, then 3, and so on; whenever a divisor works, keep dividing by it.
The sample code raises d from 2 upwards, dividing n for as long as it divides evenly. Appending to the array with factors << d is another piece of concise, idiomatic Ruby.
A common stumbling block for beginners is the different roles of the inner and outer loops. The inner loop asks "how many times does this number divide?" while the outer while loop moves on to the next candidate. Grasp that two-stage structure and the whole algorithm falls into place.
It is an idea spanning mathematics and computer science that underpins the security of cryptography such as RSA. Since 1 divides everything, it is excluded from prime factorization.
๐งช This site can't compile or run Ruby directly, so it checks on the spot whether what you typed matches the reference code (scoring happens entirely in your browser โ nothing is sent anywhere).