Reputation
1,954
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
6 13
Newest
 Yearling
Impact
~46k people reached

Jul
29
comment Calculating amount of cubes that fit in a sphere
Perhaps, you can generalize the 2D problem "squares in a circle" to 3D. See a related post.
Jul
23
comment How to draw graphs of functions?
You might want to try out the free online service fooplot.com
Jul
21
answered Why does fixed point iteration only produce the solution greater than $1$ to the equation $Mx = e^x$ for $x \in \Bbb R$?
Jul
17
comment Transportation: Minimizing Cost
Your model can be simplified. Every district is restricted to send its dump to exactly one site. Therefore, it is enough to have just one decision variable (rather than 10) per district which models the dump target site.
Jul
17
answered Transportation: Minimizing Cost
Jul
17
comment Transportation: Minimizing Cost
The decision variables of your model are twofold: 1) binary variables per district (1=dump site, 0=no dump site), 2) 10 integer variables per district where to place how many tons of dump. The capacity limit is modelled as inequality. Non-existing dump sites have capacity 0. The cost function is a sum of transportation and processing costs.
Jul
17
comment Transportation: Minimizing Cost
You could enumerate all 1024 scenarios where to place a dump site. Each district can either have a dump site or not. This results in 1024 ways to place the dump sites. For every scenario, evaluate the costs by assigning trash to the least expensive dump site in terms of processing and transportation cost. If a dump site is overloaded, assign the trash to the next site.
Jul
10
comment Why are there 31 solutions to this problem?
Here is the online plot confirming the answer 31.
Jul
6
comment Given $100$ coplanar points, no $3$ collinear, then at most $70$ percent triangles formed using these points are acute-angled
The link to IMO 1970: artofproblemsolving.com/wiki/index.php/1970_IMO_Problems/…
Jul
3
answered How to convert 3 SAT Problem to a Graph using some kind of reduction ~?
Jul
2
answered How to compute the arrival rate
Jul
2
comment How to compute the arrival rate
You could just divide the number of arrivals by the sum of times between the arrivals, provided the interarrival times do not overlap.
Jun
28
comment RSA number sequence encryption
Have a look at a related post: math.stackexchange.com/questions/379934/…
Jun
28
revised Disjoint matrix multiplication
added Schönhage's 3x3 algorithm
Jun
26
comment Disjoint matrix multiplication
At least, they are citing Schönhage and Pan as references in "Matrix Multiplication via Arithmetic Progressions".
Jun
25
answered Disjoint matrix multiplication
Jun
21
answered How do you find the minterm list of a boolean expression containing XOR?
Jun
18
answered Reduce Boolean Expression
Jun
1
comment Reduction from Circuit-Sat to 3-Sat
The Tseitin Transformation is commonly used to transform Circuit SAT to CNF SAT. The idea is to introduce one switching variable per gate. If all gates are restricted to two inputs, the transformation creates 3-SAT CNF clauses with three or fewer literals.
May
12
answered Logic gate diagram and $K$-map.