Bouncy numbers
Inspired by Project Euler n°112.
*
* Working from left-to-right if no digit is exceeded by the digit to its left it is call...
3 years 前
已解决
Euler–Mascheroni constant
Approximate the Euler-Mascheroni constant using the series representation
gamma_n=\sum_{k=1}^{n} [1/k-ln(1+1/k)]
Calculat...
3 years 前
已解决
Approximate e
Given a and n, compute and approximation to f = a * e ^ n, without the use of exp, string operations, or floating point numbers....
3 years 前
已解决
How many unique Pythagorean triples?
For a given integer |n|, return all <https://en.wikipedia.org/wiki/Pythagorean_triple Pythagorean triples> that inlude numbers s...
Polar Form Complex Number Entry
Write a function that takes the magnitude and angle(in degrees) of a complex number and returns a complex variable. Positive ang...
3 years 前
已解决
How brilliant are you?
A Brilliant number is defined as a number with two prime factors, both of which have the same number of digits. Some examples:
...
3 years 前
已解决
calculate PI without using pi function
There are many methods to get the pi(Ratio of circumference to diameter).
You should get pi without using the pi function in M...
3 years 前
已解决
Give me Hamming on five, hold the mayo
A Hamming Number is a positive number that has no prime factor greater than 5. Given a number X, determine how many Hamming num...
3 years 前
已解决
Hilbert numbers
Given a positive integer, n, return h as follows:
1. If n is not a <https://en.wikipedia.org/wiki/Hilbert_number Hilbert numb...
3 years 前
已解决
Lah Numbers
Create a square lower diagonal matrix containing the first n Lah number coefficients. In mathematics, the Lah numbers are coeffi...
3 years 前
已解决
Nth roots of unity
First, find the n nth roots of unity.
eg if n = 6, find the n distinct (complex) numbers such that n^6 = 1.
<https://en.wiki...