photo

Han Wu


Last seen: etwa 2 Monate vor Aktiv seit 2023

Followers: 0   Following: 0

Statistik

Cody

0 Probleme
19 Lösungen

RANG
N/A
of 301.379

REPUTATION
N/A

BEITRÄGE
0 Fragen
0 Antworten

ANTWORTZUSTIMMUNG
0.00%

ERHALTENE STIMMEN
0

RANG
 of 21.244

REPUTATION
N/A

DURCHSCHNITTLICHE BEWERTUNG
0.00

BEITRÄGE
0 Dateien

DOWNLOADS
0

ALL TIME DOWNLOADS
0

RANG
20.158
of 174.273

BEITRÄGE
0 Probleme
19 Lösungen

PUNKTESTAND
277

ANZAHL DER ABZEICHEN
3

BEITRÄGE
0 Beiträge

BEITRÄGE
0 Öffentlich Kanäle

DURCHSCHNITTLICHE BEWERTUNG

BEITRÄGE
0 Discussions

DURCHSCHNITTLICHE ANZAHL DER LIKES

  • Speed Demon
  • Leader
  • Solver

Abzeichen anzeigen

Feeds

Anzeigen nach

Gelöst


Compute a nested cube root
Consider the quantity . Write a function to compute without using loops or recursion.

fast 3 Jahre vor

Gelöst


Find the mean of the magic x
Given a x term, find the magic x, then find the mean/average of any one row or column.

fast 3 Jahre vor

Gelöst


Determine whether a number is prome
In discussing the unique factorization of numbers in Elementary Number Theory, Underwood Dudley devised a new number system: “C...

fast 3 Jahre vor

Gelöst


Find the circle inscribed in a triangle
Write a function that takes the x- and y-coordinates of three points describing the vertices of a triangle and returns the cente...

fast 3 Jahre vor

Gelöst


calculate PI without using pi function
There are many methods to get the pi(Ratio of circumference to diameter). You should get pi without using the pi function in M...

fast 3 Jahre vor

Gelöst


Nth roots of unity
First, find the n nth roots of unity. eg if n = 6, find the n distinct (complex) numbers such that n^6 = 1. <https://en.wiki...

fast 3 Jahre vor

Gelöst


Find Pseudo-Cyclic Number
A cyclic number is an integer in which cyclic permutations of the digits are successive multiples of the number https://en.wikip...

fast 3 Jahre vor

Gelöst


Goldbach's marginal conjecture - Write integer as sum of three primes
Goldbach's strong conjecture states that every even integer greater than 2 can be expressed as the sum of two primes. For exampl...

fast 3 Jahre vor

Gelöst


Hilbert numbers
Given a positive integer, n, return h as follows: 1. If n is not a <https://en.wikipedia.org/wiki/Hilbert_number Hilbert numb...

fast 3 Jahre vor

Gelöst


arithmetic progression
I've written a program to generate the first few terms of <https://en.wikipedia.org/wiki/Arithmetic_progression arithmetic progr...

fast 3 Jahre vor

Gelöst


Generate Square Wave
Generate a square wave of desired length, number of complete cycles and duty cycle. Here, duty cycle is defined as the fraction ...

fast 3 Jahre vor

Gelöst


Find similar sequences
Another problem inspired by a question on the <http://www.mathworks.com/matlabcentral/answers answers> forum. Given a matrix ...

fast 3 Jahre vor

Gelöst


Largest Geometric Series
Extension of Ned Gulley's wonderful Problem 317. In a geometric series, ratio of adjacent elements is always a constant value. ...

fast 3 Jahre vor

Gelöst


Approximation of Pi
Pi (divided by 4) can be approximated by the following infinite series: pi/4 = 1 - 1/3 + 1/5 - 1/7 + ... For a given number of...

fast 3 Jahre vor

Gelöst


Sum of series I
What is the sum of the following sequence: Σ(2k-1) for k=1...n for different n?

fast 3 Jahre vor

Gelöst


Angle Between Analog Clock Hands
Given a datetime variable t, return the angle (in degrees) between the hour and minute hands of an analog clock at the time repr...

fast 3 Jahre vor

Gelöst


Determine if Input is Oddish or Evenish (Odd/Even Sum of Digits)
Given a positive integer n, determine whether n is "oddish" or "evenish" - that is, whether the sum of the digits of n is odd or...

fast 3 Jahre vor

Gelöst


Boustrophedon
Given a vector v and a positive integer n, return an m-by-n matrix containing the elements of v row-wise, alternating left-to-ri...

fast 3 Jahre vor

Gelöst


Split Even Number Into Two Primes
Given an even whole number n (> 2), return a 2-element vector of primes, p, such that p(1) + p(2) = n. Fun note: technically it...

fast 3 Jahre vor