photo

Yongzhen Mi


Last seen: 2 días hace Con actividad desde 2021

Followers: 0   Following: 0

I am interested in computational mechanics.

Estadística

All
MATLAB Answers

1 Pregunta
1 Respuesta

Cody

0 Problemas
137 Soluciones

CLASIFICACIÓN
244.509
of 300.791

REPUTACIÓN
0

CONTRIBUCIONES
1 Pregunta
1 Respuesta

ACEPTACIÓN DE RESPUESTAS
0.0%

VOTOS RECIBIDOS
0

CLASIFICACIÓN
 of 21.091

REPUTACIÓN
N/A

EVALUACIÓN MEDIA
0.00

CONTRIBUCIONES
0 Archivos

DESCARGAS
0

ALL TIME DESCARGAS
0

CLASIFICACIÓN
1.172
of 171.108

CONTRIBUCIONES
0 Problemas
137 Soluciones

PUNTUACIÓN
2.083

NÚMERO DE INSIGNIAS
14

CONTRIBUCIONES
0 Publicaciones

CONTRIBUCIONES
0 Público Canales

EVALUACIÓN MEDIA

CONTRIBUCIONES
0 Temas destacados

MEDIA DE ME GUSTA

  • First Review
  • Promoter
  • Commenter
  • Sequences And Series II Master
  • Sequences And Series I Master
  • Introduction to MATLAB Master
  • Explorer
  • First Answer
  • MATLAB Central Treasure Hunt Finisher
  • Community Group Solver
  • Solver

Ver insignias

Feeds

Ver por

Resuelto


Polite numbers. Politeness.
A polite number is an integer that sums of two or more consecutive positive integers. Politeness of a positive integer is a num...

1 día hace

Resuelto


Evil Number
Check if a given natural number is evil or not. Read more at <https://oeis.org/A001969 OEIS>.

3 días hace

Resuelto


N-th Odious
Given index n return n-th <https://oeis.org/A000069 odious number>.

3 días hace

Resuelto


Find vampire numbers
A vampire number is a number v that is the product of two numbers x and y such that the following conditions are satisfied: at ...

3 días hace

Resuelto


Compute Fibonacci Number
Compute the n-th Fibonacci Number f(0) = 0, f(1) = 1, f(2) = 1, f(3) = 2, ... f(42) = 267914296

4 días hace

Resuelto


nth Rational Number
Return the nth rational number. This is the inverse to Problem 1471. Index of a Rational number The first ten positive rationa...

4 días hace

Resuelto


Armstrong Number
Determine whether the given input n-digit number is Armstrong Number or not. Return True if it is an Armstrong Number. An n-Dig...

5 días hace

Resuelto


Generate a Parasitic Number
This problem is the next step up from Problem 156. Rather than determining if an input is a parasitic number, you will be asked ...

5 días 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...

8 días hace

Resuelto


Is this number Munchhausen?
In this problem, simply return 1 if a supplied number is Munchhausen or 0 if not. Example 153 is narcissistic but not a Munchh...

12 días hace

Resuelto


Bell Number calculator
Calculate a vector of Bell numbers for sets up to length n. Bell numbers are the maximum number of partitions of a set. See the ...

21 días hace

Resuelto


Find the 9's Complement
Find the 9's complement of the given number. An example of how this works is <http://electrical4u.com/9s-complement-and-10s-c...

23 días hace

Resuelto


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

alrededor de 1 mes hace

Resuelto


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

alrededor de 1 mes hace

Resuelto


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

alrededor de 1 mes hace

Resuelto


It's going down. We're finding simbers!
This problem is inspired by Project Euler 520: Simbers. "We define a simber to be a positive integer in which any odd digit, ...

alrededor de 1 mes hace

Resuelto


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

alrededor de 1 mes hace

Resuelto


Pandigital Factors (Based on Euler 491)
A Pandigital Number is a number containing all of the digits from 0-9 inclusive, with the added stipulation that it does not hav...

alrededor de 1 mes hace

Resuelto


Pseudo Square Root (Inspired by Project Euler 266)
Shamelessly copied from the Project Euler page for Problem 266: ------------- The divisors of 12 are: 1,2,3,4,6 and 12. T...

alrededor de 1 mes hace

Resuelto


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

alrededor de 1 mes hace

Resuelto


Generalised Hamming Number
Inspired by Project Euler n°204 and Problem 1308 by James A generalised Hamming number of type n, has no prime factor larger ...

alrededor de 1 mes hace

Resuelto


Bouncy numbers
Inspired by Project Euler n°112. Working from left-to-right if no digit is exceeded by the digit to its left it is called an ...

alrededor de 1 mes hace

Resuelto


There are 10 types of people in the world
Those who know binary, and those who don't. The number 2015 is a palindrome in binary (11111011111 to be exact) Given a year...

alrededor de 1 mes hace

Resuelto


Numerical Integration
Input * |x0|, a real number greater than 0 Output * |I|, a numerical estimate of the integral x0 / I...

alrededor de 1 mes hace

Resuelto


Differential equations I
Given a function handle |f| an initial condition |y0| and a final time |tf|, solve numerically the differential equation dy...

alrededor de 1 mes hace

Resuelto


Monte-Carlo integration
Write a function that estimates a d-dimensional integral to at least 1% relative precision. Inputs: * d: positive integer....

alrededor de 2 meses hace

Resuelto


The Birthday Phenomenon
First off, leap years are not being considered for this. In fact the year that people are born shouldn't be taken into considera...

alrededor de 2 meses hace

Resuelto


Throwing Dice - Will You Be Eaten By The Dragon?
You and a dragon have agreed to let dice rolls determine whether it eats you or not. The dragon will roll a single die, of x si...

alrededor de 2 meses hace

Cargar más