Hieu

Last seen: 12개월 전 | 2023년부터 활동

Followers: 0 Following: 0

통계

Feeds

문제를 풀었습니다

Permute diagonal and antidiagonal
Permute diagonal and antidiagonal For example [1 2 3;4 5 6;7 8 9] -> [3 2 1;4 5 6;9 8 7] WITHOUT diag function (and variable n...

12개월 전

문제를 풀었습니다

Reverse the elements of an array
Reverse the order of elements in an array: eg: input X = [ 1 2 3 ; 4 5 6 ; 7 8 9 ] o...

12개월 전

문제를 풀었습니다

Matrix with different incremental runs
Given a vector of positive integers a = [ 3 2 4 ]; create the matrix where the *i* th column contains the vector *1:a(i)...

12개월 전

문제를 풀었습니다

Make an awesome ramp for a tiny motorcycle stuntman
Okay, given a vector, say v=[1 3 6 9 11], turn it into a matrix 'ramp' like so: m=[1 3 6 9 11; 3 6 9 11 0; 6 9 ...

12개월 전

문제를 풀었습니다

surrounded matrix
With a given matrix A (size m x n) create a matrix B (size m+2 x n+2) so that the matrix A is surrounded by ones: A = [1 2 ...

12개월 전

문제를 풀었습니다

Remove NaN ?
input -> matrix (n*m) with at least one element equal to NaN; output -> matrix(p*m), the same matrix where we deleted the enti...

12개월 전

문제를 풀었습니다

Flip the main diagonal of a matrix
Given a n x n matrix, M, flip its main diagonal. Example: >> M=magic(5); >> flipDiagonal(M) 9 24 1 ...

12개월 전

문제를 풀었습니다

Back to basics 23 - Triangular matrix
Covering some basic topics I haven't seen elsewhere on Cody. Given an input matrix, return a matrix with all elements above a...

12개월 전

문제를 풀었습니다

Back to basics 21 - Matrix replicating
Covering some basic topics I haven't seen elsewhere on Cody. Given an input matrix, generate an output matrix that consists o...

12개월 전

문제를 풀었습니다

How many Fibonacci numbers?
Find the number of unique Fibonacci numbers (don't count repeats) in a vector of positive integers. Example: x = [1 2 3 4...

12개월 전

문제를 풀었습니다

Is X a Fibonacci Matrix?
In honor of Cleve's new blog and post: <http://blogs.mathworks.com/cleve/2012/06/03/fibonacci-matrices/> Is X a Fibonacci ...

12개월 전

문제를 풀었습니다

Scoring for oriented dominoes
Given a list of ordered pairs, and the order they should be placed in a line, find the sum of the absolute values of the differe...

12개월 전

문제를 풀었습니다

Sum of series IX
What is the sum of the following sequence: Σ 1/k! for k=1...n for different n?

12개월 전

문제를 풀었습니다

Sum of series VIII

12개월 전

문제를 풀었습니다

Sum of series
a(n) = n^2 - (n-1)^2 find the summation of the series upto n i.e. a(1)+a(2)+...+a(n)

12개월 전

문제를 풀었습니다

Sum of series VI
What is the sum of the following sequence: Σk⋅k! for k=1...n for different n?

12개월 전

문제를 풀었습니다

Sum of series V
What is the sum of the following sequence: Σk(k+1) for k=1...n for different n?

12개월 전

문제를 풀었습니다

Sum of series IV
What is the sum of the following sequence: Σ(-1)^(k+1) (2k-1)^2 for k=1...n for different n?

12개월 전

문제를 풀었습니다

Sum of series III
What is the sum of the following sequence: Σ(2k-1)^3 for k=1...n for different n?

12개월 전

문제를 풀었습니다

Sum of series II
What is the sum of the following sequence: Σ(2k-1)^2 for k=1...n for different n?

12개월 전

문제를 풀었습니다

Sum of series I
What is the sum of the following sequence: Σ(2k-1) for k=1...n for different n?

12개월 전

문제를 풀었습니다

Sum of series VII
What is the sum of the following sequence: Σ(km^k)/(k+m)! for k=1...n for different n and m?

12개월 전

문제를 풀었습니다

Find the next prime number
Find the next prime number or numbers for given n. For example: n = 1; out = 2; or n = [5 7]; out = [7 11]; ...

12개월 전

문제를 풀었습니다

Make a vector of prime numbers
Input(n) - length of vector with prime numbers Output(v) - vector of prime numbers Example: * n=1; v=2 * n=3; v=[2 3 5...

12개월 전

문제를 풀었습니다

Largest Twin Primes
<http://en.wikipedia.org/wiki/Twin_prime Twin primes> are primes p1, p2 = p1 + 2 such that both p1 and p2 are prime numbers. Giv...

12개월 전

문제를 풀었습니다

Mersenne Primes
A Mersenne prime is a prime number of the form M = 2^p - 1, where p is another prime number. For example, 31 is a Mersenne prim...

12개월 전

문제를 풀었습니다

Find nearest prime number less than input number
Find nearest prime number less than input number. For example: if the input number is 125, then the nearest prime number whi...

12개월 전

문제를 풀었습니다

Sophie Germain prime
In number theory, a prime number p is a *Sophie Germain prime* if 2p + 1 is also prime. For example, 23 is a Sophie Germain prim...

12개월 전

문제를 풀었습니다

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

12개월 전

문제를 풀었습니다

Mersenne Primes vs. All Primes
A Mersenne prime (M) is a prime number of the form M = 2^p - 1, where p is another prime number. <https://www.mathworks.com/matl...

12개월 전

Hieu

통계

Introduction to MATLAB Master

Cody

Community Group Solver

Cody

Solver

Cody

Feeds