Recent content by andreass

Hello everyone. I would like to hear some suggestions on minimizing a function. I have discrete 2D function (a grid, where each (x,y) point have some value), where I know only extreme points (more specifically - ridges. http://en.wikipedia.org/wiki/Ridge_detection). I want to reconstruct...

c1..c6 are coefficients, but I think they will probably change when a,b,c,d,e,f change.

there's no mistake. a+b+c=d+e+f is correct

Homework Statement Given: a>=b>=c>=0, d>=e>=f>=0, a>=d a+b>=d+e a+b+c=d+e+f a,b,c,d,e,f belong to Real numbers Prove that d, e, f can be expressed as linear combinations of a, b and c in such way: d=(c1+c2)*a+(c3+c4)*b+(c5+c6)*c e = (c1+c6)*a+(c2+c4)*b+(c3+c5)*c...

Your advice is not much of a help. In the first post I stated that I don't know how to calculate minimum tickets needed and with which numbers should they be filled. So if I fill all the tickets needed with respectively needed combinations, there will be no loosing tickets.

I think I didn't write clear enough :) It is possible to have 273 different combinations (lottery tickets) if draw 3 out of 14. But I win if at least 2 of 3 numbers are correct. What is the minimum number of tickets that I need to buy, to be sure I'll win? 91 is the number of doubles that...

I have a problem, but don't know which way to try to solve it. There is lottery: 3 numbers will be drawn out of 14. Each ticket with 2 correct numbers win. If 5-8-14 will be drawn, I'll be winning also with my ticket 5-8-13 or 1-8-14 etc. Total possible tickets = 364 (combin[14,3])...

I'm trying to understand some things in finite geometries, more specific - affine geometry. Now I'm reading some notes and wiki: http://en.wikipedia.org/wiki/Finite_geometry http://en.wikipedia.org/wiki/Block_design I would like to know how many groups of parallel lines are in affine plane...

Yes, it's the same. But in my opinion "better" definition is: Graph is k-connected if and only if it contains k internally disjoint paths between any two vertices

How to prove that for every k-connected graph (k>=2) with at least 2*k vertices, there exists subgraph, which is cycle with at least 2*k vertices? Ok, it’s obvious for k=2. It looks something like cycle with or without some other edges: But I've no ideas how to prove it for k>2 Any hints?

Is there difference in absorption rate between various berries and fruits due to a place where you and your ancestors have lived? What I meant, is it true that my organism will absorb vitamin C much better from black currant than from lemon or kiwi (because I live in Baltic states and black...

Thank you for the answer. I needed String s1 = this.sks; String s2 = sk.sks; Now everything works. :) btw. sorry for terrible identification in code.

Hello. I have this JAVA code, I have to change only class "LS", so that program gets sum and displays it. But I don't know how to get command line arguments to LS class (I need them in "??", to get sum). Can anyone help? :) public class S { public static void main(String[] args)...

Ok, device measures C' and G depending of frequency. Y = G + iB, where Y - admittance, G - conductance and B - susceptance Y = i*2*pi*f*C* -> C* = C' - iC" = C' - iG/2/pi/f And Z = 1/Y So in some kind a way there is imaginary part. And both parts can be used for Cole-Cole diagram, but that is...

Here's the thing. I have 4,7 nF capacitor and AC: 1 kHz < f < 10 MHz. I measure real and imaginary part of capacitance C*=C'+iC" (C'=C'(f) and C"=C"(f)). I did 2 measurements - in first capacitor is directly attached to measuring device, in second I use 1 m coaxial cables to attach it. I...