Let n(A) = m and n(B)=n . if A has 15360 more subset than B, then (5m+3n) : (5m-3n) is as?
@dpaInc @FoolForMath @apoorvk @eigenschmeigen @experimentX @mathmagician
Looks like i forgot the basics .. is {1, 2} same as {2, 1}??
@experimentX yea think so
subsets*
n(A) = m , n(B) = n number of subsets of set S where n(S) = s is 2^s i think
yes the NO of substet = 2^n @eigenschmeigen u r correct go on
oh .. kinds looks like \[ \sum_{i=1}^{n} \binom{n}{i} - \sum_{i=1}^{m} \binom{m}{i} = 15360\]
2^m = 15360 + 2^n
n, m are integers
ok
m = 14 , n = 10 works
will there be other solutions?
@eigenschmeigen we need to find ratio
yes but if we solve then the ratio is trivial :D
5:2
but how u solved this plz show 2^m = 15360 + 2^n
are there any other solutions for n and m though is what i'm interested in
i kinda just saw that 15360 + 1024 = 16384
i'm trying to algebraically solve it right now
no u r correct....
but there may be other solutions as far as we know
no matter but how u solved this plz show 2^m = 15360 + 2^n
any way plz show
that's what i'm saying, i didnt really i just looked at it and figured it out. now i have a solution though
ok then show it let us check that!
notice that prime factorisation of 15360: \[15360 = 2^{10} \times 3 \times 5\] \[2^m = 15360 + 2^n\]\[2^m - 2^n = 15360 \]\[2^n(2^{m-n} -1) = 15360 \]\[2^n(2^{m-n} -1) = 2^{10} \times 3 \times 5 \] \[2^n(2^{m-n} -1) = 15360 = 2^{10} \times 15\]\[2^n(2^{m-n} -1) = 2^{10} (16 -1)\]\[2^n(2^{m-n} -1) = 2^{10} (2^{4} -1)\] so one solution is given by n = 10 , m-n = 4 m = 14
i'm not sure whether i have proved this is unique, hopefully someone can confirm
yes u r correct this was the way my teacher i just forfot to take a note at that time thxxx
to show uniqueness it is necessary for \[2^k \times 15 \neq (2^q - 1) \text{ , } 0<k \le 10\]
which is true as \[2^k(2^4 -1) = 2^{k+4} - 2^k\]
Join our real-time social learning platform and learn together with your friends!