bubnicbf/Harshad-numbers

Stars
2
Language
C#
Created over 9 years ago
Updated over 9 years ago

bubnicbf/Harshad-numbers

bubnicbf

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

lists the first twenty members of the sequence and the first Harshad number greater than 1000

Fast-Fourier-Transform-using-Cooley-Tukey-algorithm

the most common fast Fourier transform (FFT) algorithm

Ray-Casting-Algorithm

checks to see if a point is inside or outside the polygon using the ray-casting algorithm

Random-Number-Generator-using-Normal-Distribution

generates a collection filled with 1000 normally distributed random (read pseudorandom) numbers with a mean of 1.0 and a standard deviation of 0.5

Gaussian-elimination

Solution Ax=b using Gaussian elimination then backwards substitution.

Calculate-Pi-using-Monte-Carlo

approximate the value of a function using random sampling to define constraints on the value and then makes a sort of "best guess."

Star-Chart

An web app that shows the night sky at a given location and date

PiDayPizzaHutContest

Brownian-Motion

Brownian motion simulation in an M-dimensional region

Quine

a self-referential program that can, without any external access, output its own source

Arithmetic-Parsing

parses and evaluates arithmetic expressions

Box-Behnken-design

returns a set of sample argument values to be used to analyze the behavior of a function

PatternCount

Perfect-Numbers

Determines if a positive integer is a perfect number

Analemma

h evaluates the equation of time, a formula for the difference between the uniform 24 hour day and the actual position of the sun,

Fisher-Yates-shuffle

Implements the Fisher-Yates shuffle for an array.

phys_410

SAS-tests

Range-Expansion

A format for expressing an ordered list of integers is to use a comma separated list

Burgers-equation

solves the steady (time-independent) viscous Burgers equation using a finite difference discretization of the conservative form of the equation, and then applying Newton's method to solve the resulting nonlinear system

ChristofidesAlgorithm

Eulerian Walk Approximation Method Within a Factor of 1.5

SemiPrimes

determines whether a given number is semiprime, the product of two prime numbers

Monte-Carlo-Integral-Estimates

techniques for numerical integration using random numbers

Amicable-Pairs

Calculates the Amicable pairs under a number p=20000

Physics-Libraries

Jupyter Notebook

Prime-Numbers-using-Agrawal-Kayal-Saxena-algorithm

tests whether a number is prime is a polynomial-time algorithm based on an elementary theorem about Pascal triangles

Forward-Finite-Difference

produces a list of numbers which is the n-th order forward difference, given a non-negative integer (specifying the order) and a list of numbers

daily_scripts

stuff I schedule or run a lot

Number-Reversal-using-Fisher-Yates

an algorithm for generating a random permutation of a finite set—in plain terms, for randomly shuffling the set.

Collatz-conjecture

By repetition on any natural number n. If n is even, take n / 2. If n is odd, take 3n + 1. The conjecture is you will always eventually reach 1.

Database-Selector-for-Visual-Studio

de-Moivre-number

Given n, find the n-th de Moivre number

Newton-Cooling-using-Euler-method

Euler's method numerically approximates solutions of first-order ordinary differential equations with a given initial value.

Regular-Numbers

finds numbers whose only prime divisors are 2, 3, and 5.

Catmull-Clark-subdivision-surface

The Catmull–Clark algorithm is a technique used in computer graphics to create smooth surfaces by subdivision surface modeling.

Nonlinear-Equation-Solver-using-Reverse-Communication

Calculates solutions of a scalar nonlinear equation f(x)=0, or a system of nonlinear equations, using reverse communication (RC)

Knuth-algorithm

This is a method of randomly sampling n items from a set of M items, with equal probability; where M >= n and M, the number of items is unknown until the end.

Runge-Kutta

A method of numerically integrating ordinary differential equations by using a trial step at the midpoint of an interval to cancel out lower-order error terms.