A résolu

Seemingly impossible problem
This is a _seemingly_ 'impossible' problem, because variously your function, "impossibleFn", must return an output of either 1 o...

presque 5 ans il y a

A résolu

Anyone for tennis? Your chances of winning a tie-break game
Imagine you are playing tennis and the score has reached 'six games all' in a Tie-break Set, so therefore the next game shall be...

presque 5 ans il y a

A résolu

Anyone for tennis? Your chances of winning a (standard) game
Imagine you are playing tennis, and for _each point_ played your chance of winning is |x| % (input as a |<https://au.mathworks.c...

presque 5 ans il y a

A résolu

Guess the number I'm thinking of (Part 2)
Have you tried the original "Guess the number I'm thinking of" (Problem 44630)? This problem is just like that, except that the...

presque 5 ans il y a

A résolu

Guess the number I'm thinking of (Part 1)
In this game you are competing against two other people to guess the number that I'm thinking of. I randomly choose an integer ...

presque 5 ans il y a

A résolu

Cancel Middle
Write a function called cancel_middle that takes A, an n-by-m matrix, as an input where both n and m are odd numbers an...

presque 5 ans il y a

A résolu

Sort Except Zeros
Sort the numbers in a vector. But the position of zeros should not be changed. Example: sort_except_zeros( [5 3 0 0 2 4] ) == [...

presque 5 ans il y a

A résolu

Double Fibonacci
double_fibonacci takes two integers, each greater than one, as input arguments (it does not have to check the format of the inpu...

presque 5 ans il y a

A résolu

Numbers spiral diagonals (Part 2)
Inspired by Project Euler n°28 and 58. A n x n spiral matrix is obtained by starting with the number 1 and moving to the right ...

presque 5 ans il y a

A résolu

Numbers spiral diagonals (Part 1)
Inspired by Project Euler n°28 et 58. A n x n spiral matrix is obtained by starting with the number 1 and moving to the right...

presque 5 ans il y a

A résolu

Recurring Cycle Length (Inspired by Project Euler Problem 26)
Preface: This problem is inspired by <http://projecteuler.net/problem=26 Project Euler Problem 26> and uses text from that quest...

presque 5 ans il y a

A résolu

Project Euler: Problem 18, Maximum path sum I
By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bott...

presque 5 ans il y a

A résolu

Project Euler: Problem 16, Sums of Digits of Powers of Two
2^15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the sum of the digits of the number 2^N? Thanks ...

presque 5 ans il y a

A résolu

Longest Collatz Sequence
Inspired by Projet Euler n°14. The Collatz iterative sequence (See Cody problem n° 2103 and 211) is defined for the set of po...

presque 5 ans il y a

A résolu

Large Sum (inspired by Project Euler 13)
Your function will be provided an arbitrary number of numbers of arbitrary sizes as a cell array of strings. Some numbers will b...

presque 5 ans il y a

A résolu

Divisors for big integer
Inspired by Problem 1025 and Project Euler 12. Given n, return the number y of integers that divide N. For example, with ...

presque 5 ans il y a

A résolu

Highly divisible triangular number (inspired by Project Euler 12)
Triangular numbers can be calculated by the sum from 1 to n. For example, the first 10 triangular numbers are: 1, 3, 6, 10, ...

presque 5 ans il y a

A résolu

Project Euler: Problem 11, Largest product in a grid
What is the greatest product of _k_ adjacent numbers in the same direction (up, down, left, right, or diagonally) in a _n×n_ gri...

presque 5 ans il y a

A résolu

Duplicates
Write a function that accepts a cell array of strings and returns another cell array of strings *with only the duplicates* retai...

presque 5 ans il y a

A résolu

Sum of big primes without primes
Inspired by Project Euler n°10 (I am quite obviously a fan). With problem n°250 by Doug, you can find some global methods to ...

presque 5 ans il y a

A résolu

Sums of cubes and squares of sums
Given the positive integers 1:n, can you: 1. Compute twice the sum of the cubes of those numbers. 2. Subtract the square...

presque 5 ans il y a

A résolu

Genome Sequence 003R: Sequence DNA of random positioned and flipped segments
This is Challenge 003R in the series on Genome DNA Sequencing. Challenge 3R includes flipped segments. DNA Sequencing is naively...

presque 5 ans il y a

A résolu

Genome Sequence 003: DNA Sequence with random positioned segments
This Challenge series will evolve the complexity of Genome DNA Sequencing. DNA Sequencing and the Shot Gun Method will be naivel...

presque 5 ans il y a

A résolu

Genome Sequence 002: Introductory DNA Sequencing (Flipped Segments)
This Challenge series will evolve the complexity of Genome DNA Sequencing. <http://en.wikipedia.org/wiki/Genome DNA Sequencing> ...

presque 5 ans il y a

A résolu

Genome Sequence 001: Introductory DNA Sequencing
This Challenge series will evolve the complexity of Genome DNA Sequencing. <http://en.wikipedia.org/wiki/Genome DNA Sequencing> ...

presque 5 ans il y a

Réponse apportée
Error in setdiff function
One workaround is to replace all NaNs with some spceific value that is not present in your data, say -9999: >> S1 = [1,2,3,NaN,...

environ 5 ans il y a | 0

Réponse apportée
How can I solve an ode where one of the variables is a matrix?
A(t) should be a function, not a vector. Below I define A as an anonymous function. I also use an anonymous function for your ...

environ 5 ans il y a | 0

| A accepté

Réponse apportée
4D data /Index exceed array bounds
I think it may be better to let M_Val be a cell array of 5 ordinary arrays, where M_Val{k} is of dimension 134 by 2 by nsyll(k)....

environ 5 ans il y a | 0

A résolu

Pi Estimate 1
Estimate Pi as described in the following link: <http://www.people.virginia.edu/~teh1m/cody/Pi_estimation1.pdf>

environ 5 ans il y a

Réponse apportée
4D data /Index exceed array bounds
I think you may have inadvertently created a cell array containing your whole data matrix in element 1. Something like this: >...

environ 5 ans il y a | 0