解決済み

Easy Sequences 66: Fractional Part of Sum of Consecutive Powers over a Prime
Given three postive integers, , and , create the function , defined as follows: Where is the th prime and the s...

8ヶ月前

解決済み

Easy Sequences 63: Base-63 Arithmetic Functions
In this exercise we are required to implement 7 basic 'unsigned integer' arithmetic functions in base-63: to63(x) - convert...

8ヶ月前

解決済み

Easy Sequences 62: Sum of Omega-3 Function
For an integer , the prime big omega function, , is defined as the total number of prime factors of . If , since , therefore . ...

8ヶ月前

解決済み

Easy Sequence 61: Wide Pythagorean Triangles
An integer-sided right triangle with sides , is called a "wide Pythagorean triangle", if , and . Write a program that counts a...

8ヶ月前

解決済み

Easy Sequences 58: Curious Prime-Rational Functions
For some prime numbers and where , a rational function , is defined as follows: . Using the output , another rational functi...

8ヶ月前

解決済み

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

8ヶ月前

解決済み

Easy Sequences 51: Positive Gaussian Primes
A Gaussian Prime is a gaussian integer that cannot be decomposed as product of two non-unit gaussian integers (the complex units...

8ヶ月前

解決済み

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

8ヶ月前

解決済み

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

8ヶ月前

解決済み

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

9ヶ月前

解決済み

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

10ヶ月前

解決済み

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

10ヶ月前

解決済み

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

10ヶ月前

解決済み

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

10ヶ月前

解決済み

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

10ヶ月前

解決済み

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

10ヶ月前

解決済み

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]

12ヶ月前

解決済み

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

12ヶ月前

解決済み

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

約1年前

解決済み

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

約1年前

解決済み

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

1年以上前

解決済み

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

1年以上前

解決済み

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

1年以上前

解決済み

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

1年以上前

解決済み

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

1年以上前

解決済み

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

1年以上前

解決済み

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

1年以上前

解決済み

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

1年以上前

解決済み

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

1年以上前

解決済み

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

1年以上前