Stéphane Vaillant
Followers: 0 Following: 0
Statistiken
RANG
10.619
of 289.726
REPUTATION
4
BEITRÄGE
0 Fragen
1 Antwort
ANTWORTZUSTIMMUNG
0.00%
ERHALTENE STIMMEN
0
RANG
of 19.581
REPUTATION
N/A
DURCHSCHNITTLICHE BEWERTUNG
0.00
BEITRÄGE
0 Dateien
DOWNLOADS
0
ALL TIME DOWNLOADS
0
BEITRÄGE
0 Beiträge
BEITRÄGE
0 Öffentlich Kanäle
DURCHSCHNITTLICHE BEWERTUNG
BEITRÄGE
0 Highlights
DURCHSCHNITTLICHE ANZAHL DER LIKES
Feeds
Gelöst
Proper Factors
Generate the proper factors of input integer _x_ and return them in ascending order. For more information on proper factors, ref...
fast 3 Jahre vor
Gelöst
Multiples of a Number in a Given Range
Given an integer factor _f_ and a range defined by _xlow_ and _xhigh_ inclusive, return a vector of the multiples of _f_ that fa...
fast 3 Jahre vor
Gelöst
Get all prime factors
List the prime factors for the input number, in decreasing order. List each factor. If the prime factor occurs twice, list it as...
fast 3 Jahre vor
Gelöst
Smith numbers
Return true if the input is a Smith number in base ten. Otherwise, return false. Read about Smith numbers at <http://en.wikipedi...
fast 3 Jahre vor
Gelöst
Factorize THIS, buddy
List the prime factors for the input number, in decreasing order. List each factor only once, even if the factorization includes...
fast 3 Jahre vor
Gelöst
Prime factor digits
Consider the following number system. Calculate the prime factorization for each number n, then represent the prime factors in a...
fast 3 Jahre vor
Gelöst
Radial Zernike polynomials
Given an integer _n_ ≥ 0 and an integer _m_ ≥ 0, generate the <http://en.wikipedia.org/wiki/Zernike_polynomials radial Zer...
fast 3 Jahre vor
Gelöst
Test for balanced parentheses
Given the input inStr, give the boolean output out indicating whether all the parentheses are balanced. Examples: * If ...
fast 3 Jahre vor
Gelöst
Summing digits
Given n, find the sum of the digits that make up 2^n. Example: Input n = 7 Output b = 11 since 2^7 = 128, and 1 + ...
fast 3 Jahre vor
Gelöst
Who Has the Most Change?
You have a matrix for which each row is a person and the columns represent the number of quarters, nickels, dimes, and pennies t...
fast 3 Jahre vor
Gelöst
Determine if input is odd
Given the input n, return true if n is odd or false if n is even.
fast 3 Jahre vor
Gelöst
Rosenbrock's Banana Function and its derivatives
Write a function to return the value of <http://en.wikipedia.org/wiki/Rosenbrock_function Rosenbrock's two-dimensional banana fu...
fast 3 Jahre vor
Gelöst
Generalized Laguerre polynomials
Given an integer _n_ ≥ 0 and a scalar _a_, generate the _n_-th <http://en.wikipedia.org/wiki/Laguerre_polynomials#Generalized...
fast 3 Jahre vor
Gelöst
Calculate Euler's phi function
Compute the Euler's phi function of a large integer. For more information about this topic please visit: <https://en.wikiped...
fast 3 Jahre vor
Gelöst
Legendre polynomials
Given an integer _n_ ≥ 0, generate the _n_-th <http://en.wikipedia.org/wiki/Legendre_polynomials Legendre polynomial>. *Ex...
fast 3 Jahre vor
Gelöst
Laguerre polynomials
Given an integer _n_ ≥ 0, generate the _n_-th <http://en.wikipedia.org/wiki/Laguerre_polynomials Laguerre polynomial>. *Ex...
fast 3 Jahre vor
Gelöst
Chebyshev polynomials of the 2nd Kind
Given an integer _n_ ≥ 0, generate the _n_-th <http://en.wikipedia.org/wiki/Chebyshev_polynomials Chebyshev polynomial of the...
fast 3 Jahre vor
Gelöst
Chebyshev polynomials of the 1st Kind
Given an integer _n_ ≥ 0, generate the _n_-th <http://en.wikipedia.org/wiki/Chebyshev_polynomials Chebyshev polynomial of the...
fast 3 Jahre vor
Gelöst
Hermite Polynomials
Return the _n_-th <http://en.wikipedia.org/wiki/Hermite_polynomials Hermite polynomial> of the physicists' type. Assume that ...
fast 3 Jahre vor
Gelöst
Ackermann's Function
Ackermann's Function is a recursive function that is not 'primitive recursive.' <http://en.wikipedia.org/wiki/Ackermann_fun...
fast 3 Jahre vor
Gelöst
Kepler's Equation
Solve <http://en.wikipedia.org/wiki/Kepler's_equation Kepler's Equation>. Note that the solution is rounded down to 5 decima...
fast 3 Jahre vor
Gelöst
Project Euler: Problem 4, Palindromic numbers
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 ...
fast 3 Jahre vor
Gelöst
Project Euler: Problem 8, Find largest product in a large string of numbers
Find the greatest product of five consecutive digits in an n-digit number. 73167176531330624919225119674426574742355349194934...
fast 3 Jahre vor
Gelöst
Project Euler: Problem 10, Sum of Primes
The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below the input, N. Thank you <http:/...
fast 3 Jahre vor
Gelöst
Project Euler: Problem 9, Pythagorean numbers
A Pythagorean triplet is a set of three natural numbers, a b c, for which, a^2 + b^2 = c^2 For example, 3^2 + 4^2 =...
fast 3 Jahre vor
Gelöst
Project Euler: Problem 6, Natural numbers, squares and sums.
The sum of the squares of the first ten natural numbers is, 1^2 + 2^2 + ... + 10^2 = 385 The square of the sum of the first ...
fast 3 Jahre vor
Gelöst
Project Euler: Problem 7, Nth prime
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the Nth prime nu...
fast 3 Jahre vor
Gelöst
Project Euler: Problem 5, Smallest multiple
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smalle...
fast 3 Jahre vor
Gelöst
Project Euler: Problem 3, Largest prime factor
The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number being input, input might be ui...
fast 3 Jahre vor
Gelöst
Project Euler: Problem 1, Multiples of 3 and 5
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23...
fast 3 Jahre vor