Calculate primes since the first number until the 10001th

Ciro Dourado

Last update: Apr 29, 2021

Related tags

Web programming find_prime

Overview

find_prime

Explaining this code:

find_prime is a function that takes the nth index to be calculated.
Note that this nth does not follow the array convention of starting at 0:

it is first received as an ordinal number;
checked if is between 1 and 10001;
then passed to lower functions, "converted" to array index.

Then we have _find_prime (which in a private/public context shoudn't be called by a programmer):
It does all the hardlifting, and what it's meant to do, which is calculate the desirable prime number.
We know that primes start at 2, going to 3, 5, 7... and so on; so primes are some sort of set/interval, mathematically represented by
[2, +inf)
Thus, it must be represented on code as a range, which purpose fits correctly at this situation - it starts at a well-defined point, and goes to the end, not inclusive (and if you dont specify, the compiler will treat this as an infinite loop, unless you give some function that will serve as a stop condition)

And there it goes. To iterate over this infinite interval, looking only for primes, we must use a filter function. It will take another function called is_prime to serve as predicate (personal opinion here: I think it's clearer to use functions instead of closures - it's better to read, to maintain, to keep track of the program flow; I only use closures when it's needed to capture some environment variable, which it's the obvious purpose of using them, it's their function!)

[to be continued]

🍹Branch and bound solution using Rust to calculate an optimal cocktail ingredient list of arbitrary length 🍸

Calculating an Optimal Cocktail Ingredient List Tom Explains the Problem You have 100 different ingredients You have 20 cocktails, each of which use 2

7 Jan 9, 2023

A number of collections, such as linked-lists, binary-trees, or B-Trees are most easily implemented with aliasing pointers.

StaticRc is a safe reference-counted pointer, similar to Rc or Arc, though performing its reference-counting at compile-time rather than run-time, and

372 Dec 19, 2022

Fast and easy random number generation.

alea A zero-dependency crate for fast number generation, with a focus on ease of use (no more passing &mut rng everywhere!). The implementation is bas

26 Dec 13, 2022

Hypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.

224 Dec 21, 2022

A command-line utility which aligns a block of text within the terminal (or a specified number of columns), written in Rust.

align: a command line utility for aligning text. ⭐ Overview Aligns text within the terminal (or a specified number of columns). The text is treated as

6 Aug 11, 2023

Comments

To-do: change _is_prime iteration

Using nth, despite giving an easy way to put a breakpoint on the undefined range, makes our iterator loop once more just to take the last number (the searched prime).

Consider changing it to a for loop: keep track of how many primes where found, stop and immediately return on the last.
enhancement

opened by ciroDourado 1

Calculate primes since the first number until the 10001th

Related tags

Overview

find_prime

Explaining this code:

You might also like...

🍹Branch and bound solution using Rust to calculate an optimal cocktail ingredient list of arbitrary length 🍸

A number of collections, such as linked-lists, binary-trees, or B-Trees are most easily implemented with aliasing pointers.

Fast and easy random number generation.

Hypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.

Number names is a Rust library to provide formatted string names for cardinal and ordinal numbers.

File Tree Fuzzer allows you to create a pseudo-random directory hierarchy filled with some number of files.

📘 Utilities for the Fibonacci Number and Sequence

Outputs a random number of 🌈's

Generating the nth Fibonacci number

A Rust attribute macro to limit a function's number of runs over a specified period of time

A small random number generator hacked on top of Rust's standard library. An exercise in pointlessness.

A Rust library for random number generation.

Some collections to store a fixed number of elements of a specific type.

Convert number like 42 to forty-two

SWC Transform to prefix logs. Useful for adding file and line number to logs

1️⃣ el lisp number uno - one lisp to rule them all 🏆

Python module implemented in Rust for counting the number of one bits in a numpy array.

A plugin to enable random number generation for the Bevy game engine.

A command-line utility which aligns a block of text within the terminal (or a specified number of columns), written in Rust.

Comments

To-do: change _is_prime iteration

Owner

Ciro Dourado

Find RSA primes in files

Waits until the exit code of a program is zero

Tells you how many years you need to wait until your subatomic xeon crystal synchronizer has doubled in plasma inversion efficiency on the Goldberg-Moleman scale or whatever.

Lazy Sieve of Eratosthenes for infinitely generating primes lazily in Rust.

A brief implementation of a simple hello world program in rust since they said it couldn't be done.

🐳 📦 Bringing docker containers to your AUR helper since 2022

Like wee_alloc, but smaller since I used skinnier letters in the name.

Library to calculate TF-IDF (Term Frequency - Inverse Document Frequency) for generic documents.

A tool to calculate mean and standard deviation from multiple tests using PageSpeed Insights API.

Calculate a player's skill level using Elo, DWZ, Ingo, TrueSkill, Glicko and Glicko-2 algorithms known from their usage in chess and online games.