A résolu


Easy Sequences 50: Blocked Gaussian Integers
A Gaussian Integer is a complex number whose real and imaginary parts are both integers. A gaussian integer is said to be bloc...

7 mois il y a

A résolu


Easy Sequences 54: Product of Products of Proper Divisors
A divisor of a number that is less than the number is called a "proper divisor". For a given positive integer , we are asked t...

7 mois il y a

A résolu


Easy Sequences 60: Almost Cube Root
The almost cube root of an integer , is the largest possible integer , such that and . For example , then , since and since th...

8 mois il y a

A résolu


Easy Sequences 59: Almost Twin Primes
A positive integer pair , is called an "almost twin prime pair", if one of the pair is a prime and the other is either a prime o...

9 mois il y a

A résolu


Easy Sequences 55: "Ugly" Rectangles?
A positive integer is called a regular number, if and only if there exist a non-negative integer , such that . For some reason...

9 mois il y a

A résolu


Easy Sequences 56: Counting "Ugly" Numbers
A positive integer is called a regular number, if and only if there exist a non-negative integer , such that . For some reason...

9 mois il y a

A résolu


Easy Sequences 53: Greatest Proper Divisor
The greatest proper divisor () of an integer is the largest integer , such that and . Furthermore, we define: . Below is the...

9 mois il y a

A résolu


Easy Sequences 52: Non-squarable Rectangles
Any integer-sided rectangle can be cut into unit rectangles () and rearranged into sets of smaller rectangles. For example the ...

9 mois il y a

A résolu


Return area of square
Side of square=input=a Area=output=b

9 mois il y a

A résolu


Reverse the vector
Reverse the vector elements. Example: Input x = [1,2,3,4,5,6,7,8,9] Output y = [9,8,7,6,5,4,3,2,1]

11 mois il y a

A résolu


Calculate Amount of Cake Frosting
Given two input variables r and h, which stand for the radius and height of a cake, calculate the surface area of the cake you n...

11 mois il y a

A résolu


Five-dimensional maze
*Description* The traditional maze is 2-dimensional: the navigator can move in the positive or negative directions along two ...

environ un an il y a

A résolu


One track five lanes
Find the minimum number of lane changes necessary to cross the entire track without running into any obstacles <<http://www.a...

environ un an il y a

A résolu


Parse me a Lisp
*Description* In Lisp and its variants, function calls are done using parenthesis where the first item in the parenthesis is ...

environ un an il y a

A résolu


Recaman Sequence - III
I want to create a Recaman sequence where there is a "1" in the n-th position. So from which integer should I start the Recaman ...

environ un an il y a

A résolu


Pair Primes
Let's define pair primes as follow; For 2 digits numbers: 11 and 17 are pair primes because both of them are 2 digits prime num...

environ un an il y a

A résolu


Birthday cake
It's Cody's 5th birthday, and you've been tasked with putting the candles on the cake. Your goal is to maximize the distance bet...

environ un an il y a

A résolu


Day counter function
Write a function called _day_counter_ that returns the number of Mondays that fell on the first day of the month in a given year...

environ un an il y a

A résolu


Decimation
When dealing to the Roman Army, the term decimate meant that the entire unit would be broken up into groups of ten soldiers, and...

environ un an il y a

A résolu


Odd elimination
Inspired by Project Euler problem #539 You'll be given a vector from 1 to n; Going from left to right, remove the first n...

environ un an il y a

A résolu


Pandigital Multiples of 11 (based on Project Euler 491)
A "Pandigital number of order X" is one that contains all of the numbers from 0 to X, but with no leading zeroes. If X>9, the cy...

environ un an il y a

A résolu


Project Euler 249: Prime Subset Sums
Inspired by Problem 249 of Project Euler. <https://projecteuler.net/problem=249> Let S = {2, 3, 5, ...} be the set of prime ...

environ un an il y a

A résolu


Easy Sequences 49: Prime Little Omega Function
For an integer , the prime little omega function, , is defined as the total number of distinct prime factors of . So, if , sinc...

environ un an il y a

A résolu


Easy Sequences 48: Prime Big Omega of Factorial Sequence
For an integer , the prime big omega function, , is defined as the total number of prime factors of . So, if , since , therefor...

environ un an il y a

A résolu


Easy Sequences 47: Boxes with Prime Edges
This is related to problem "Easy Sequences 41: Boxes with Integer Edges". However, here we will be investigating a smaller-sized...

environ un an il y a

A résolu


Easy Sequences 46: Semi-prime Leap Year Pairs
A semi-prime is a positive integer that has only and exactly prime factors. Here is a list of the first few semi-primes:. We...

environ un an il y a

A résolu


Easy Sequences 45: Second Derivative of Inverse Polynomial Function
The inverse of a function, is the function , that reverses . That means that if , then . For example, the function to convert ce...

environ un an il y a

A résolu


Easy Sequences 44: Finding the Smallest Number whose Cube is divisible by a Factorial
Given a integer , our goal is to find the smallest integer , such that divides . For example, for , , because , (since ), and ...

environ un an il y a

A résolu


Easy Sequences 42: Areas of Non-constructible Polygons
A constructible polygon is a regular polygon that can be constructed using only a compass and a straightedge. Amazingly, Gauss ...

environ un an il y a

A résolu


Easy Sequences 41: Boxes with Integer Edges
For this problem, we are asked to write a function that will count the number of boxes with integer edges, that has the same giv...

environ un an il y a

Charger plus