Tagged Questions
0
votes
1answer
74 views
Puzzle identification and solving algorithm
I am trying to solve 8x8 puzzle (total 64 buttons). Similar to LightsOut, but in this rules are different. Goal is turn ON every button.
Example:
...
3
votes
0answers
82 views
Difference between two sets of data points
I'm making a simple calibration of a z-stage, by measuring a number of points in one direction with a constant $\Delta$Z between each sample. Then I reverse the direction and measure the same number ...
8
votes
2answers
48 views
Having $A_1=a+b+c$,$A_2=a^2+b^2+c^2$, $A_3=a^3+b^3+c^3$ - how to get $a,b,c$?
Perhaps I'm just a bit dense at the moment - I've re-read some of my notes from monthes ago concerning elementary symmetric polynomials, and I find that I've no idea how to approach the "inverse" ...
1
vote
0answers
52 views
Find total number of sets of integers which satisfy a given equality and inequality
Compute the total number of different sets of integers a1, a2,..,an which satisfy the following equality and constraints:
$$
...
0
votes
1answer
119 views
Interview Question: Best method to gather groceries [closed]
I went to an interview the other day and the interviewer asked me this question:
"You are in the grocery store shopping for 10 people with 1 shopping cart. You have a different shopping list for each ...
2
votes
1answer
164 views
Methods of solving a problem regarding withdrawing and depositing from a bank account.
I have an imaginary bank account with an initial balance $x$. I can only withdraw $0\% < w\% < 100\%$ (of the current balance) or deposit $0\% < d\% < 100\%$ (of the current balance) at a ...
1
vote
1answer
424 views
Solving modular inequalities/constraint solving
A few of my current programming problems boil down to solving inequalities over modular domains and possibility could benifit from knowledge of efficient maths/algorithms rather than brute force ...
6
votes
3answers
155 views
Is there an efficient algorithm to find a length maximizing combination?
The problem is the following
Given $v_1, \, v_2, \, \ldots, \, v_n \in \mathbb R^m$; find $\epsilon_1, \, \epsilon_2, \, \ldots, \, \epsilon_n \in \{0,1\}$ such that
$$\left\vert \sum_{i=1}^n ...
2
votes
3answers
994 views
The fastest algorithm for asymmetric travelling salesman problem (TSP)
What is the fastest algorithm for asymmetric TSP?
Maybe someone knows the fastest solution according to computer calculations. For example, WinQSB calculates 60 cities in 2-3 seconds on Intel Core 2, ...
2
votes
2answers
100 views
How to find the lowest cost supplier-product mix?
I was given a Excel spreadsheet with this table:
The user wants to find the lowest price mix amongst the various suppliers. The user wants to constrain the number of products that each supplier ...
2
votes
1answer
161 views
Counting digits in an arithmetic sequence
Given $a, d, n, x$.
Suggest me a suitable algorithm to compute the number of times the digit $x$ appearing in the arithmetic sequence $a, a + d, a + 2 \times d, \cdots, a + n \times d$.
For ...
