Protobufs for Diagnostic Ordering and Resulting

Provides Ruby support for building web applications with the Primate framework

A brief excercise and exploration of primes. cli, benchmarks and tests between diffent prime generation algorithms, etc

Returns the prime factors of an integer up to one hundred million

A command line utility which prints multiplication table of first n primes.

Display an n x n matrix of prime products

Write a program that calculates and prints out a multiplication table of the first 10 calculated prime numbers.

Test primes faster than Ruby's default methods by using the Miller-Rabin method.

Write a program that calculates and prints out a multiplication table of the first 10 calculated prime numbers.

Prints prime at given position and multiplication table of primes

Output the multiplication table of the first `n` prime numbers

Methods: prime?, primemr?, primes, primesmr, primescnt, primescntmr, primenth|nthprime, factors|prime_division, factors1, next_prime, prev_prime, primes_utils

Displays the products of N primes in a table format. Optionally uses generated primes or precalculated.

Generate and display prime number table in the terminal

Command line program that prints out a table of primes with each cell containing the product of the primes.

First Gem

It generates first n Prime numbers using naive brute force approach.

The most reusable components from several domain-focused libraries will be extracted here as a common consumption point.

Get primitive root and Euler totient by passing integer

This gem creates a thin shell to encapsulate primitive literal types such as integers, floats and symbols. There are a family of wrappers which mimic the behavior of what they contain. Primitive types have several drawbacks: no constructor to call, can't create instance variables, and can't creat...