Gelöst

Compute the perimeter of an ellipse
While the area of an ellipse is straightforward to compute, the perimeter (or circumference) is more complicated. The perimeter ...

fast 6 Jahre vor

Gelöst

Counting the Grand Primes
A grand prime pair is a pair of primes, p1 and p2=p1+1000, such that both numbers are prime. Like a twin prime pair, where the d...

fast 6 Jahre vor

Gelöst

Find Pseudo-Cyclic Number
A cyclic number is an integer in which cyclic permutations of the digits are successive multiples of the number https://en.wikip...

fast 6 Jahre vor

Gelöst

Amicable numbers
Test whether two numbers are <https://en.wikipedia.org/wiki/Amicable_numbers amicable>, meaning that the sum of the proper divis...

fast 6 Jahre vor

Gelöst

Pseudo Square Root (Inspired by Project Euler 266)
Shamelessly copied from the Project Euler page for Problem 266: ------------- The divisors of 12 are: 1,2,3,4,6 and 12. T...

fast 6 Jahre vor

Gelöst

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...

fast 6 Jahre vor

Gelöst

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...

fast 6 Jahre vor

Gelöst

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....

fast 6 Jahre vor

Gelöst

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...

fast 6 Jahre vor

Gelöst

Goldbach's marginal conjecture - Write integer as sum of three primes
Goldbach's strong conjecture states that every even integer greater than 2 can be expressed as the sum of two primes. For exampl...

fast 6 Jahre vor

Gelöst

Consecutive Powers
Return 2 numbers and 2 powers such that their difference is 1 A 4 element row vector is expected: x where x(1)^x(2) - x(...

fast 6 Jahre vor

Gelöst

Find two triangular numbers whose sum is input.
Find two triangular numbers whose sum is _input_. Note: The difference beetween the triangular numbers should be minimum.

fast 6 Jahre vor

Gelöst

I'm going to enjoy watching you calculate, Mr Anderson
Smith numbers are numbers such that if you add up all of the digits in the number, that sum equals the sum of all of the digits ...

fast 6 Jahre vor

Gelöst

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...

fast 6 Jahre vor

Gelöst

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: ...

fast 6 Jahre vor

Gelöst

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...

fast 6 Jahre vor

Gelöst

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...

fast 6 Jahre vor

Gelöst

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...

fast 6 Jahre vor

Gelöst

Lah Numbers
Create a square lower diagonal matrix containing the first n Lah number coefficients. In mathematics, the Lah numbers are coeffi...

fast 6 Jahre vor

Gelöst

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...

fast 6 Jahre vor

Gelöst

Find Logic 12

fast 6 Jahre vor

Gelöst

Find Logic 10

fast 6 Jahre vor

Gelöst

Find Logic 9

fast 6 Jahre vor

Gelöst

Find Logic 8

fast 6 Jahre vor

Gelöst

Find Logic 7

fast 6 Jahre vor

Gelöst

Find Logic 6

fast 6 Jahre vor

Gelöst

Find Logic 4

fast 6 Jahre vor

Gelöst

Find Logic 3

fast 6 Jahre vor

Gelöst

Find Logic 1

fast 6 Jahre vor

Gelöst

Find Logic 11

fast 6 Jahre vor