解決済み


Solve an ODE: equation A

約1ヶ月 前

解決済み


Iterate the sum of divisors and totient

約1ヶ月 前

解決済み


Calculate Euler's phi function
Compute the Euler's phi function of a large integer. For more information about this topic please visit: <https://en.wikiped...

約1ヶ月 前

解決済み


Sum of all the divisors of n

約1ヶ月 前

解決済み


Highest building

約2ヶ月 前

解決済み


Add 100

約2ヶ月 前

解決済み


Pentagonal Numbers
Your function will receive a lower and upper bound. It should return all pentagonal numbers within that inclusive range in ascen...

約2ヶ月 前

解決済み


Last non-zero digit
Given a number n, find the last non-zero digit of the factorial of that number. You need to take care of the large values of n....

約2ヶ月 前

解決済み


Champernowne Constant
The <http://en.wikipedia.org/wiki/Champernowne_constant Champernowne constant> is a real number whose digits in decimal represen...

約2ヶ月 前

解決済み


Is it an Armstrong number?
An Armstrong number of three digits is an integer such that the sum of the cubes of its digits is equal to the number itself. Fo...

約2ヶ月 前

解決済み


Lychrel Number Test (Inspired by Project Euler Problem 55)
The task for this problem is to create a function that takes a number _n_ and tests if it might be a Lychrel number. This is, re...

約2ヶ月 前

解決済み


Ordinal numbers
Given an integer n, return the corresponding ordinal number as a character string. For example, ord(1)='1st' ord(2)=...

約2ヶ月 前

解決済み


Determine if input is a perfect number
A <http://en.wikipedia.org/wiki/Perfect_number/ perfect number> occurs whent the sum of all divisors of a positive integer, exce...

約2ヶ月 前

解決済み


Determine if input is a Narcissistic number
<http://en.wikipedia.org/wiki/Narcissistic_number Narcissistic number> is a number that is the sum of its own digits each raised...

約2ヶ月 前

解決済み


Fangs of pseudo-vampire number
given a number, find all the fangs of that number. A pseudo-vampire number can have multiple of fangs. The output should be a...

約2ヶ月 前

解決済み


Kaprekar numbers
Test if the input is a Kaprekar number: <http://mathworld.wolfram.com/KaprekarNumber.html>. Return a logical true or false. ...

約2ヶ月 前

解決済み


Parasitic numbers
Test whether the first input x is an n-parasitic number: <http://en.wikipedia.org/wiki/Parasitic_number>. ( _n_ is the second in...

約2ヶ月 前

解決済み


Woodall number
Test whether the input is a Woodall number: <http://en.wikipedia.org/wiki/Woodall_number> _Please do not cheat by simply chec...

約2ヶ月 前

解決済み


Find all vampire fangs
A <http://en.wikipedia.org/wiki/Vampire_number vampire number> is a number v that is the product of two numbers x and y such th...

約2ヶ月 前

解決済み


Fangs of a vampire number
A <http://en.wikipedia.org/wiki/Vampire_number vampire number> is a number v that is the product of two numbers x and y such tha...

約2ヶ月 前

解決済み


Find vampire numbers
A <http://en.wikipedia.org/wiki/Vampire_number vampire number> is a number v that is the product of two numbers x and y such th...

約2ヶ月 前

解決済み


generate nth pentatope number
https://en.wikipedia.org/wiki/Pentatope_number

約2ヶ月 前

解決済み


check whether a number is a pentatope number
<https://oeis.org/A000332>

約2ヶ月 前

解決済み


Cantor counting
Find the nth cantor's rational number. the sequence is given below in the link. Sequence: 1/1,1/2,2/1,3/1,2/2,1/3,1/4... ... .....

約2ヶ月 前

解決済み


find nth even fibonacci number
1st even fibonacci number=2 ; 2nd even fibonacci number=8 ..

約2ヶ月 前

解決済み


Bell Triangle
Form the bell triangle upto nth bell number posotion; * if n=5 * y= [1 0 0 0 0; 1 2 0 0...

約2ヶ月 前

解決済み


Be happy
check whether the given number is happy in b-base. * A happy number can be defined as a number which will yield 1 when it is ...

約2ヶ月 前

解決済み


Frugal number
check whether n is a frugal number * a frugal number is a natural number in a given number base that has more digits than the...

約2ヶ月 前

解決済み


Pell numbers
Find the nth pell number <https://en.wikipedia.org/wiki/Pell_number>

約2ヶ月 前

Load more