Gelöst

Generate a point cloud on an equilateral triangle 2
The input is the iteration parameter H. The output is a point cloud W involving N points. W is N uniformly distributed points ...

mehr als ein Jahr vor

Gelöst

Generate a point cloud on an equilateral triangle 3
The input is the iteration parameter H. The output is a point cloud W involving N points. W is N uniformly distributed points ...

mehr als ein Jahr vor

Gelöst

Generate a point cloud on an equilateral triangle 1
The input is the iteration parameter H. The output is a point cloud W involving N points. W is N uniformly distributed points ...

mehr als ein Jahr vor

Gelöst

Generate a point cloud named `Incremental Lattice Design`
The input is the number of dimensions M and the parameter H. The output is a point cloud W involving N points. W is N uniforml...

mehr als ein Jahr vor

Gelöst

Generate a point cloud named `Simplex-Lattice Design`
The input is the number of dimensions M and the parameter H. The output is a point cloud W involving N points. W is N uniforml...

mehr als ein Jahr vor

Gelöst

Easy Sequences 104: One-line Code Challenge - GCDs of Sum of Consecutive Cubes
For a natural number, n, the function CC(n) is defined as follows: In other words, CC(n) is the sum of cubes ...

mehr als ein Jahr vor

Gelöst

Easy Sequences 14: Consecutive Composites
Generating a given number of consecutive numbers all of which are composites is easy. For example the following is a sequence of...

mehr als ein Jahr vor

Frage

In a (possibly directed) graph, is there a simple way to find all nodes reachable for a given node?
I've recently started working with MATLAB graphs. In two recent problems, I have graphs which are not known to be connected eve...

mehr als ein Jahr vor | 2 Antworten | 1

2

Antworten

Gelöst

Compute the Sisyphus sequence
A recent article in the New York Times featured the Online Encyclopedia of Integer Sequences, founded by Neil J.A. Sloane. One o...

mehr als ein Jahr vor

Gelöst

List primes of the form xy+z
Consider three consecutive integers , , and . When is the number prime? For example, if or , then the results are 17 and 37, ...

mehr als ein Jahr vor

Gelöst

Determine whether a number is a Gaussian prime
A Gaussian prime is a number that cannot be factored. For example, is not a Gaussian prime because it can be factored as the p...

mehr als ein Jahr vor

Gelöst

Express numbers as the sum of a prime, a square, and a cube
While traveling on an interstate highway, I noticed a sign that gave distances to three places. The distances were 3, 8, and 9 m...

mehr als ein Jahr vor

Gelöst

Determine whether a number is a Zeisel number
Do you know what is interesting about the number 1729? That’s right: it’s the third Zeisel number, a number given by , where ...

mehr als ein Jahr vor

Gelöst

Compute the largest number whose prime factors sum to n
This problem deals with a sequence whose tenth term is 36 because the prime factors of 36 (2, 2, 3, 3) sum to 10. The number 32 ...

mehr als ein Jahr vor

Gelöst

List the Moran numbers
The quotient of a Moran number and its digit sum is prime. For example, 117 and 481 are Moran numbers because 117/(1+1+7) is 13 ...

mehr als ein Jahr vor

Gelöst

List the cuban primes
The number 61 is a cuban prime because it is prime and the difference two cubes, 64 and 125. Write a function to list the cuba...

mehr als ein Jahr vor

Gelöst

List the semiprimes
A semiprime number—or a 2-almost prime—is the product of two prime numbers. The numbers and are semiprimes, but and are not....

mehr als ein Jahr vor

Gelöst

Compute the bubble popper fidget spinner sequence
A fidget spinner is a toy made of multiple lobes that pivot on a ball bearing. In some, the lobes hold bubble poppers, or rubber...

mehr als ein Jahr vor

Gelöst

Factor a number into Fermi-Dirac primes
Cody Problem 58018 asked you to list the Fermi-Dirac primes, which are prime powers with exponents that are powers of 2. As note...

mehr als ein Jahr vor

Gelöst

List the Fermi-Dirac primes
The Fermi-Dirac “primes” are prime powers with exponents that are powers of 2. The first nine terms of the sequence are 2, 3, 4,...

mehr als ein Jahr vor

Gelöst

Identify de Polignac numbers
The numbers 125 and 329 can be written as the sum of a prime and a power of 2. For example, , and . The numbers 127 and 331, whi...

mehr als ein Jahr vor

Gelöst

List numbers such that every sum of consecutive positive integers ending in those numbers is composite
The sequence in question in this problem involves numbers such that all sums of consecutive positive integers ending with are ...

mehr als ein Jahr vor

Gelöst

List the two-bit primes
Each year at Christmas, my father-in-law and his partner send me the Puzzle Mania section from the New York Times. This year’s e...

fast 2 Jahre vor

Gelöst

Solve an equation involving primes and fractions
Write a function to find pairs of primes and satisfying the equation where is an integer. The function should take a numbe...

fast 2 Jahre vor

Gelöst

List odd twin composites
Twin primes, or prime numbers that differ by 2 (e.g., 17 and 19, 59 and 61, or 191 and 193), are the subject of several Cody pro...

fast 2 Jahre vor

Gelöst

List the Beatriz numbers
Write a function to find integers less than or equal to an input value that solve the equation . The function gives the sum o...

fast 2 Jahre vor

Gelöst

List the Euclid numbers
Euclid proved that the number of primes is infinite with the following argument. Suppose the primes form a finite set , , . Comp...

fast 2 Jahre vor

Gelöst

Create Combination
Motivation: In many problems, we need to create combinations with the function nchoosek. In some cases, however, choices are lim...

etwa 2 Jahre vor

Gelöst

Usage of java.math : N Choose K with unlimited precision
Calculate the binomial coefficient nchoosek with full accuracy. This challenge may use the wonderful word of java.math that allo...

etwa 2 Jahre vor

Gelöst

Get ranking of a combination looking for speed.
I have the numbers pulled without replacement from the set [1 2 3 4 5 6 7 8 9 10 11 12 13]; They are then ordered from least to...

etwa 2 Jahre vor