Risolto

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

6 mesi fa

Risolto

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

6 mesi fa

Risolto

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

7 mesi fa

Risolto

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

8 mesi fa

Risolto

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

8 mesi fa

Risolto

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

8 mesi fa

Risolto

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

8 mesi fa

Risolto

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

8 mesi fa

Risolto

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]

10 mesi fa

Risolto

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

10 mesi fa

Risolto

Five-dimensional maze

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

Parse me a Lisp

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa

Risolto

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

circa un anno fa