A résolu


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

environ 3 ans il y a

A résolu


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

environ 3 ans il y a

A résolu


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

environ 3 ans il y a

A résolu


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

environ 3 ans il y a

A résolu


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

environ 3 ans il y a

A résolu


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

environ 3 ans il y a

A résolu


It's going down. We're finding simbers!
This problem is inspired by Project Euler 520: Simbers. "We define a simber to be a positive integer in which any odd digit, ...

environ 3 ans il y a

A résolu


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

environ 3 ans il y a

A résolu


Easy Sequences 81: Fibonacci Radicals
The radical of a positive integer is defined as the product of the distinct prime numbers dividing . For example, the distinct ...

environ 3 ans il y a

A résolu


Sphenic number sequence
Sphenic numbers are positive integers that are products of three distinct prime numbers: 30, 42, 66, 70, 78, 102, 105, 110, 114,...

environ 3 ans il y a

A résolu


Easy Sequences 80: Sum of the n-th Row of Fibonacci Square Triangle
We shall call the following arrangement of Fibonacci numbers, as the Fibonacci Square Triangle: where...

environ 3 ans il y a

A résolu


Easy Sequences 79: Trailing Zeros of Fibonorial Numbers at any Base
The fibonorial of an integer is defined as follows: where: is the -th Fibonacci number ( and for ). I...

environ 3 ans il y a

A résolu


Easy Sequences 76: Not so easy as Pisano Pi
Pisano period , of an integer , is the period in which the sequence of Fibonacci numbers modulo repeats. For example it is not ...

environ 3 ans il y a

A résolu


Easy Sequences 77: Powers of Fibonacci Numbers
Given integers and , we are asked to evaluate the following function: . That is, equals raised to the power of the -th Fibona...

environ 3 ans il y a

A résolu


Easy Sequences 75: Easy as Pisano Pi
Pisano period , of an integer , is the period in which the sequence of Fibonacci numbers modulo repeats. For example it is not ...

environ 3 ans il y a

A résolu


Easy Sequences 74: Fibonacci Bank Account
In fantasy world where money does grow on trees, a man decided to top-up his bank account, daily. On the first day he noticed th...

environ 3 ans il y a

A résolu


Easy Sequences 73: Emergence of Fibonacci Insects
Cicadas are natural mathematicians. In order to avoid their natural predators (in this case, the wasp), they emerge from hiberna...

plus de 3 ans il y a

A résolu


Easy Sequences 43: Least Common Fibonacci Number
The Fibonacci sequence is a series whose elements are numbers starting with and , and subsequent Fibonacci numbers are defined...

plus de 3 ans il y a

Réponse apportée
How to search for substring in cell array and get the corresponding index then?
If I'm understanding correctly, cellfun(@numel,strfind(string(val),"EXPERIMENT")) will give you a matrix with 1's where th...

plus de 3 ans il y a | 0

A résolu


Triangle Coordinates
Given a natural number n, return two -element vectors, x and y, containing the coordinates of a triangular arrangement of points...

plus de 3 ans il y a

A résolu


Angle Between Analog Clock Hands
Given a datetime variable t, return the angle (in degrees) between the hour and minute hands of an analog clock at the time repr...

plus de 3 ans il y a

A résolu


Extract the Acrostic Message
An acrostic cipher is a way of embedding one message within another by taking the first (or last) word of each line. Given a str...

plus de 3 ans il y a

A résolu


Boustrophedon
Given a vector v and a positive integer n, return an m-by-n matrix containing the elements of v row-wise, alternating left-to-ri...

plus de 3 ans il y a

A résolu


Create block matrix of integers (j+k-1) - Part II
Given m, n, p, and q, create an m-by-n matrix made up of submatrices, each sized p-by-q (if possible - the last row and column o...

plus de 3 ans il y a

A résolu


Create block matrix of integers (j+k-1) - Part I
Given m, n, p, and q, create a matrix of m-by-n blocks (submatrices), each sized p-by-q. The elements of the (j,k)th block all h...

plus de 3 ans il y a

A résolu


Dartboard Average II
A dartboard arranges the numbers 1 to 20 such that each value is typically flanked by quite different values - for example, 20 i...

plus de 3 ans il y a

A résolu


Possible Rugby Scores
Given a natural number s (> 4), representing a rugby team's score, return an n-by-3 matrix representing all n possible combinati...

plus de 3 ans il y a

A résolu


Split Even Number Into Two Primes
Given an even whole number n (> 2), return a 2-element vector of primes, p, such that p(1) + p(2) = n. Fun note: technically it...

plus de 3 ans il y a

A résolu


Determine if Input is Oddish or Evenish (Odd/Even Sum of Digits)
Given a positive integer n, determine whether n is "oddish" or "evenish" - that is, whether the sum of the digits of n is odd or...

plus de 3 ans il y a

A résolu


Create initial basic feasible solution for transportation problems -Minimum Cost Method

plus de 3 ans il y a

Charger plus