Solved

Evaluate the zeta function for complex arguments

<https://www.mathworks.com/matlabcentral/cody/problems/45988 Cody Problem 45988> involved computing the Riemann zeta function fo...

1 year ago

Solved

Construct the Seidel-Entringer-Arnold triangle

Several problems in Cody ask us to construct part or all of triangles in which entries follow a pattern. Cody Problems <https://...

1 year ago

Solved

Evaluate the Struve function

The <https://en.wikipedia.org/wiki/Struve_function Struve function> *H*_a(x) is a solution to an inhomogeneous form of Bessel's ...

1 year ago

Solved

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

1 year ago

Solved

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

1 year ago

Solved

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

1 year ago

Solved

Amicable numbers

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

1 year ago

Solved

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

1 year ago

Solved

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

1 year ago

Solved

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

1 year ago

Solved

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

1 year ago

Solved

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

1 year ago

Solved

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

1 year ago

Solved

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

1 year ago

Solved

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.

1 year ago

Solved

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

1 year ago

Solved

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

1 year ago

Solved

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

1 year ago

Solved

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

1 year ago

Solved

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

1 year ago

Solved

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

1 year ago

Solved

Lah Numbers

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

1 year ago

Solved

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

1 year ago