Estadística
0 Problemas
163 Soluciones
CLASIFICACIÓN
N/A
of 300.780
REPUTACIÓN
N/A
CONTRIBUCIONES
0 Preguntas
0 Respuestas
ACEPTACIÓN DE RESPUESTAS
0.00%
VOTOS RECIBIDOS
0
CLASIFICACIÓN
of 21.086
REPUTACIÓN
N/A
EVALUACIÓN MEDIA
0.00
CONTRIBUCIONES
0 Archivos
DESCARGAS
0
ALL TIME DESCARGAS
0
CLASIFICACIÓN
1.017
of 171.018
CONTRIBUCIONES
0 Problemas
163 Soluciones
PUNTUACIÓN
2.307
NÚMERO DE INSIGNIAS
12
CONTRIBUCIONES
0 Publicaciones
CONTRIBUCIONES
0 Público Canales
EVALUACIÓN MEDIA
CONTRIBUCIONES
0 Temas destacados
MEDIA DE ME GUSTA
Feeds
Resuelto
Divisors for big integer
Inspired by Problem 1025 and Project Euler 12. Given n, return the number y of integers that divide N. For example, with ...
alrededor de 2 meses hace
Resuelto
Numbers spiral diagonals (Part 1)
Inspired by Project Euler n°28 et 58. A n x n spiral matrix is obtained by starting with the number 1 and moving to the right...
alrededor de 2 meses hace
Resuelto
Project Euler: Problem 5, Smallest multiple
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smalle...
alrededor de 2 meses hace
Resuelto
Project Euler: Problem 6, Natural numbers, squares and sums.
The sum of the squares of the first ten natural numbers is, 1^2 + 2^2 + ... + 10^2 = 385 The square of the sum of the first ...
alrededor de 2 meses hace
Resuelto
Determine whether a number is a cluster prime
A <https://mathworld.wolfram.com/ClusterPrime.html cluster prime> is an odd prime number _p_ such that all even numbers less tha...
alrededor de 2 meses hace
Resuelto
Determine digits of the Copeland-Erdos constant
<https://www.mathworks.com/matlabcentral/cody/problems/1477-champernowne-constant/solutions/new Cody Problem 1477> asks us to de...
alrededor de 2 meses hace
Resuelto
Identify primorial primes
Cody Problems <https://www.mathworks.com/matlabcentral/cody/problems/46054-count-trailing-zeros-in-a-primorial 46054> and <https...
alrededor de 2 meses hace
Resuelto
Investigate the frequency of last digits of prime numbers
The last digit of a prime number greater than 5 can be 1, 3, 7, or 9. If the primes are distributed randomly, then these digits ...
alrededor de 2 meses hace
Resuelto
Compute the nth Pythagorean prime
Pythagorean primes have the form p = 4n+1, where n is an integer, and they can be written as the sum of squares of two integers....
alrededor de 2 meses hace
Resuelto
List the emirps
An emirp is a prime number that becomes a different prime when reversed. The numbers 13, 17, and 149 are emirps, but 11, 19, and...
alrededor de 2 meses hace
Resuelto
Count trailing zeros in a primorial
<https://www.mathworks.com/matlabcentral/cody/problems/44068-the-number-of-trailing-zero-digit-of-a-factorial Cody Problem 44068...
alrededor de 2 meses hace
Resuelto
Largest Twin Primes
<http://en.wikipedia.org/wiki/Twin_prime Twin primes> are primes p1, p2 = p1 + 2 such that both p1 and p2 are prime numbers. Giv...
alrededor de 2 meses hace
Resuelto
Find nearest prime number less than input number
Find nearest prime number less than input number. For example: if the input number is 125, then the nearest prime number whi...
alrededor de 2 meses hace
Resuelto
Sophie Germain prime
In number theory, a prime number p is a *Sophie Germain prime* if 2p + 1 is also prime. For example, 23 is a Sophie Germain prim...
alrededor de 2 meses hace
Resuelto
The Goldbach Conjecture
The Goldbach conjecture asserts that every even integer greater than 2 can be expressed as the sum of two primes. Given the eve...
alrededor de 2 meses hace
Resuelto
Make a vector of prime numbers
Input(n) - length of vector with prime numbers Output(v) - vector of prime numbers Example: * n=1; v=2 * n=3; v=[2 3 5...
alrededor de 2 meses hace
Resuelto
Smith numbers
Return true if the input is a Smith number in base ten. Otherwise, return false. Read about Smith numbers at http://en.wikipedia...
alrededor de 2 meses hace
Resuelto
Project Euler: Problem 3, Largest prime factor
The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number being input, input might be ui...
alrededor de 2 meses hace
Resuelto
Prime factor digits
Consider the following number system. Calculate the prime factorization for each number n, then represent the prime factors in a...
alrededor de 2 meses hace
Resuelto
Factorize THIS, buddy
List the prime factors for the input number, in decreasing order. List each factor only once, even if the factorization includes...
alrededor de 2 meses hace
Resuelto
Get all prime factors
List the prime factors for the input number, in decreasing order. List each factor. If the prime factor occurs twice, list it as...
alrededor de 2 meses hace
Resuelto
Proper Factors
Generate the proper factors of input integer x and return them in ascending order. For more information on proper factors, refer...
alrededor de 2 meses hace
Resuelto
Multiples of a Number in a Given Range
Given an integer factor _f_ and a range defined by _xlow_ and _xhigh_ inclusive, return a vector of the multiples of _f_ that fa...
alrededor de 2 meses hace
Resuelto
Triangle sequence
A sequence of triangles is constructed in the following way: 1) the first triangle is Pythagoras' 3-4-5 triangle 2) the second...
alrededor de 2 meses hace
Resuelto
Fibonacci-Sum of Squares
Given the Fibonacci sequence defined by the following recursive relation, * F(n) = F(n-1) + F(n-2) * where F(1) = 1 and F(1)...
alrededor de 2 meses hace
Resuelto
Number of Even Elements in Fibonacci Sequence
Find how many even Fibonacci numbers are available in the first d numbers. Consider the following first 14 numbers 1 1 2...
alrededor de 2 meses hace
Resuelto
Project Euler: Problem 2, Sum of even Fibonacci
Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 te...
alrededor de 2 meses hace
Resuelto
Return the Fibonacci Sequence
Write a code which returns the Fibonacci Sequence such that the largest value in the sequence is less than the input integer N. ...
alrededor de 2 meses hace
Resuelto
Fibonacci sequence
Calculate the nth Fibonacci number. Given n, return f where f = fib(n) and f(1) = 1, f(2) = 1, f(3) = 2, ... Examples: Input...
alrededor de 2 meses hace
