FYI: we cannot execute "matlabpool open" on the labs. ;)
What it does: it finds the maximum number of occurrences for each prime number smaller than x in the factorisations of the numbers 1:x (e.g., for x = 10, the maximum number of occurrences for 2 is 3, since 2*2*2 = 8). If the product of all prime factors taken to the power of their maximum # of occurrences is then taken, the smallest number that is divisible by 1:10 is obtained. So for x = 10: 2 * 2 * 2 * 3 * 3 * 5 * 7 = 2520.
This code works but the server is too slow...
Knight's Tour Checker
Project Euler: Problem 1, Multiples of 3 and 5
04 - Scalar Equations 1
Convert given decimal number to binary number.
Given a window, how many subsets of a vector sum positive
Steal, Share, or Catch: Tournament of Champions
Implement simple rotation cypher
Convert a vector into a number
Getting the absolute index from a matrix
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office