問題


Easy Sequences 103: One-line Code Challenge - Evaluate String Math Expressions
Given a character string of a simple mathematical expression containing only numbers, parentheses and arithmetic symbols (+ - * ...

1年以上 前 | 0 | 1 個のソルバー

解決済み


List numbers such that every sum of consecutive positive integers ending in those numbers is composite
The sequence in question in this problem involves numbers such that all sums of consecutive positive integers ending with are ...

1年以上 前

解決済み


List the two-bit primes
Each year at Christmas, my father-in-law and his partner send me the Puzzle Mania section from the New York Times. This year’s e...

1年以上 前

解決済み


Error handling
If the input is a negative number, generate an error. Otherwise, return the number.

1年以上 前

解決済み


Easy Sequences 20: Counting Prime-sided Rectangles
A prime-sided rectangle is a rectangle having sides represented by prime numbers. The figure below shows all the possible prime-...

1年以上 前

解決済み


Armstrong Number
Write a function name armstrong_check that checks whether the given input is an Armstrong Number or not. It returns logical True...

1年以上 前

解決済み


Zero finder
Write a function named 'zero_finder' that takes a matrix as input and returns the row index of the last zero for each for each c...

1年以上 前

解決済み


Inscribe a circle in a triangle with a side of length equal to the circle’s circumference
A circle of radius is inscribed in a triangle with a side that has a length equal to the circle’s circumference. The center of ...

1年以上 前

問題


Easy Sequences 102: One-line Code Challenge - Take While Function
takeWhile is another useful functional programming construct. The takewhile function is similar to the built-in function arrayfu...

1年以上 前 | 0 | 0 個のソルバー

問題


Easy Sequences 101: One-line Code Challenge - n-th Digit of Fibonacci Sequence
For a given index , the -th Fibonacci number, is defined as: for or , and for . What this problem requires is find the dig...

1年以上 前 | 0 | 0 個のソルバー

解決済み


Regular polygon bounded by and bounding a circle
As the number of sides (or vertices) of a regular polygon goes to infinity, its perimeter and area go to the perimeter and area ...

1年以上 前

解決済み


Optimally fill a container with elements of different sizes
Given a row vector V of different numerical values and a size limit L, return a 1x2 vector A, containing (a) the largest sum of ...

1年以上 前

解決済み


Vector addition
Given two row vectors, v1 and v2, each representing an integer, such that the vector elements are the digits from left to right,...

1年以上 前

解決済み


Sum of combinations
Input: *X = 40*, *Y = [40 20 10 4]* Output: *Z = [1 0 0 0; 0 2 0 0; 0 1 2 0; 0 1 1 3; 0 1 0 5; 0 0 4 0; 0 0 3 3; 0 0 2 5; 0 ...

1年以上 前

解決済み


Factorizing a number into a given number of factors
Given a positive integer, n, and another positive integer, b, return a matrix, M, of width b, with the following properties: (a)...

1年以上 前

解決済み


Radius of an inner N-dimensional sphere
A hypercube is an N-dimensional analogue of a square (N=2). Similarly, an N-sphere is an N-dimensional analogue of a circle. Not...

1年以上 前

解決済み


Bernoulli's Triangle
Generate the bernoulli's triangle upto nth row. <https://mathworld.wolfram.com/BernoulliTriangle.html>

1年以上 前

解決済み


4 Digit Sequence Repetitions
Given a 4 digit integer, a sequence can be created such that the next digit in the sequence is the ones digit from the sum of th...

1年以上 前

解決済み


Identify the sequence
Given a row vector, x, return 1 if it is an arithmetic series, or 2 if it is a geometric series. If it is neither, return 0. ...

1年以上 前

解決済み


Repeat string n times
You will be provided a string (s = 'string1_') a starting point (num1 = 6) (always bigger than or equal to zero) and n (n = 3)...

1年以上 前

解決済み


Integer Sequence - 1
Check the test suite to determine the relationship between input integer scalar and output integer scalar.

1年以上 前

解決済み


realsmall
Please return the smallest positive number. This is a little silly problem, but the solution has some funny properties...

1年以上 前

解決済み


Perimeter
Given a sequence of points forming a closed path (first and last points are coincident) return the perimeter value. For example...

1年以上 前

解決済み


Area-06
The length of the side of a square is given. Draw 4 quarter-circles inside the square from 4 corners with a radius equal to the...

1年以上 前

解決済み


The twelve days of Christmas
Traditionally there are twelve days of Christmas to celebrate ("Twelvetide"), typically starting with Christmas Day (25 December...

1年以上 前

解決済み


Sorting integers by their digits (Level 2)
This is the next step up from <http://www.mathworks.com/matlabcentral/cody/problems/42809-sorting-integers-by-their-digits Probl...

1年以上 前

解決済み


Method of Common Differences part-1
Use the method of common differences to output a vector containing the initial values and the nth order difference. ex ...

1年以上 前

解決済み


Easy Sequences 95: LCM Sums
For a given , write the function lcmSum(n), defined as follows: For example for : >> lcmSum = @(n) sum...

1年以上 前

解決済み


Unusual Concatenations
The sum of the squares of certain unusual integers is equal to the concatenation of their individual digits. For example: ...

1年以上 前

問題


Easy Sequences 100: One-line Code Challenge - 100th Digit of 100th power of an Integer
Given a integer , write a function that computes the digit of . If has less than digits just output a NaN. For example if , ...

1年以上 前 | 0 | 2 個のソルバー

さらに読み込む