Community Profile

photo

Are Mjaavatten


Last seen: Today

Mjaavatten Consulting

323 2015 年以降の合計貢献数

I have a MSc in physics from the University of Oslo and a PhD in control engineering from NTNU in Trondheim (mainly modelling, I am not much of a control engineer). My main interests are mathematical modelling, numerical methods, and thermodynamics. I worked in the petroleum and chemical process industries for some 35 years and I am now semi-retired

連絡する

Are Mjaavatten's バッジ

  • Thankful Level 1
  • Knowledgeable Level 3
  • 6 Month Streak
  • Leader
  • Community Group Solver
  • Card Games Master
  • Personal Best Downloads Level 4
  • 5-Star Galaxy Level 5
  • GitHub Submissions Level 1
  • Editor's Pick
  • First Review
  • First Submission
  • Tiles Challenge Master
  • ASEE Challenge Master
  • Speed Demon

すべて表示

貢献した分野
表示方法

解決済み


Find the fastest reaction chain to reach a target compound
This problem is related to Problem <45470>. Let's denote a list of *N* compounds as 1, 2, ..., *N*. You are then given a list...

1日 前

解決済み


List the households affected by leaks in water distribution
Consider the following water distribution network, where water is pumped uni-directionally from left to right: 8...

2日 前

解決済み


Design a minimum-cost cable network for a power grid
You are given the 2-D point locations ( _xi_ , _yi_ ) of *N* _components_ of a power grid. These _components_ include power sour...

4日 前

解決済み


Propagate the effects of a blockage in a chemical plant
From the perspective of flow, a chemical plant can be described by a collection of _nodes_ and _edges_. _Nodes_ are points where...

5日 前

解決済み


Pitting corrosion on a metal plate: Find the largest pit
You are given an N x M matrix of _ones_ and _zeros_, which represents an image of a rectangular metal plate taken from the hull ...

6日 前

解決済み


Pitting corrosion on a metal plate: Count the number of pits
You are given an N x M matrix of _ones_ and _zeros_, which represents an image of a rectangular metal plate taken from the hull ...

6日 前

解決済み


Better Index Number
Let's say you want to save many, many files and append these files with a certain sortable index number. As you probably know, y...

8日 前

解決済み


Smallest n, for n! to have m trailing zero digits
For given positive integer n, its factorial often has many trailing zeros, in other words many factors of 10s. In order for n! t...

8日 前

解決済み


Whole Number Un-Concatenator
Write a function that accepts an integer and an index digit and returns a vector containing two integers which are the leading a...

10日 前

解決済み


Whole Number Concatenator
Write a function that concatenates whole numbers. For example: numcat(111,222) should return 111222 numcat(1,2,3,4,5) s...

10日 前

解決済み


The number of trailing zero digit of a factorial
For given positive integer n, take factorial of that number. How many trailing zeros does it have? Example: factorial(11) = 3...

11日 前

解決済み


The last non-zero digit of a factorial
For given positive integer n, what is the last non-zero digit of n!? Example: factorial(11) = 39916800 Last non-zero d...

12日 前

解決済み


Permutation Via Multiplication
Given two numbers a and b, determine if the product ab is a permutation of the digits of a. For example, this is always true for...

12日 前

解決済み


Lunar Arithmetic (Multiplication)
<https://oeis.org/A087061 OEIS link for a description of lunar arithmetic> Simply take the larger digit when adding and take ...

13日 前

解決済み


Lunar Arithmetic (Addition)
<https://oeis.org/A087061 OEIS link for a description of lunar arithmetic> Simply take the larger digit. Example 1: ...

13日 前

解決済み


Muphry's Law of MATLAB
You're running some simple multiplication problems through MATLAB for error checking purposes, but nothing seems to come up with...

14日 前

解決済み


Convert from Base 10 to base 5
Convert the input number from base 10 into base 5: for example: if a(in base 10)= 5 then a(in base 5)= 10

14日 前

解決済み


Expand 10^n to Powers of 4
Given an integer n, return the coefficients c = [c_n,c_n-1,...,c_0] Such that 10^n = c_n*4^(n) + c_n-1*4^(n-1...

14日 前

解決済み


Numbers on 7-segment
This is a 7-segment: _ |_| |_| It's a 3-by-3 char matrix.It has made by 3 characters: '_' , '|' and ' ' (space...

15日 前

解決済み


Pattern Sum
Write a function which receives two single digit positive integers, (k and m) as parameters and calculates the total sum as: k...

18日 前

解決済み


Still more miles to go before I sleep
It's time for more odometer fun. Last problem, my car's odometer hit 56789. It's coming up on 111111 now, which (barring a maj...

18日 前

解決済み


Find the next prime number
Find the next prime number or numbers for given n. For example: n = 1; out = 2; or n = [5 7]; out = [7 11]; ...

20日 前

解決済み


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

20日 前

解決済み


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

20日 前

解決済み


Mersenne Primes
A Mersenne prime is a prime number of the form M = 2^p - 1, where p is another prime number. For example, 31 is a Mersenne prim...

20日 前

解決済み


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

20日 前

解決済み


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

20日 前

解決済み


Circular Primes (based on Project Euler, problem 35)
The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime. The...

20日 前

解決済み


Mersenne Primes vs. All Primes
A Mersenne prime (M) is a prime number of the form M = 2^p - 1, where p is another prime number. <https://www.mathworks.com/matl...

20日 前

解決済み


Divisible by 7
Pursuant to the <http://www.mathworks.com/matlabcentral/cody/problems/42404-divisible-by-2 first problem> in this series, this o...

20日 前

Load more