Statistik
0 Probleme
9 Lösungen
RANG
N/A
of 301.564
REPUTATION
N/A
BEITRÄGE
0 Fragen
0 Antworten
ANTWORTZUSTIMMUNG
0.00%
ERHALTENE STIMMEN
0
RANG
of 21.333
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 Discussions
DURCHSCHNITTLICHE ANZAHL DER LIKES
Feeds
Gelöst
Vandermonde Matrix
Create the Vandermonde Matrix of the given vector. The matrix consists of columns as powers of the vector, so the first column i...
6 Monate vor
Gelöst
Magnet and Iron
(Inspired from <http://www.mathworks.com/matlabcentral/cody/problems/112 Problem 112: Remove the air bubbles>) Iron (atomic n...
6 Monate vor
Gelöst
remove single elements
Given a vector of integers, remove the elements that have appeared only once. The output elements should be in exact order as th...
6 Monate vor
Gelöst
Hermite Polynomials
Return the _n_-th <http://en.wikipedia.org/wiki/Hermite_polynomials Hermite polynomial> of the physicists' type. Assume that ...
6 Monate vor
Gelöst
Calculate the area of a triangle between three points
Calculate the area of a triangle between three points: P1(X1,Y1) P2(X2,Y2) P3(X3,Y3) these three points are the vertices of ...
6 Monate vor
Gelöst
Numbers with prime factors 2, 3 and 5.
Make a function which takes one positive integer n and returns a matrix with the numbers of the form (2^i)*(3^j)*(5^k) which are...
6 Monate vor
Gelöst
Find the longest sequence of 1's in a binary sequence.
Given a string such as s = '011110010000000100010111' find the length of the longest string of consecutive 1's. In this examp...
6 Monate vor
Gelöst
Circular Primes (based on Project Euler, problem 35)
The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime. The...
6 Monate vor
Gelöst
The Goldbach Conjecture
The Goldbach conjecture asserts that every even integer greater than 2 can be expressed as the sum of two primes. Given the eve...
7 Monate vor

