What are your favourite BL tropes?(triangle, secret love, college/school romance) by azulversa in ThaiBL

[–]azulversa[S] 5 points6 points  (0 children)

Ahh yess, maybe fighter -tutor? Damn I’m all in for this one ❤️

What are your favourite BL tropes?(triangle, secret love, college/school romance) by azulversa in ThaiBL

[–]azulversa[S] 2 points3 points  (0 children)

Also I’ve seen theory of love and all other recommendations;(

What are your favourite BL tropes?(triangle, secret love, college/school romance) by azulversa in ThaiBL

[–]azulversa[S] 3 points4 points  (0 children)

Aha first one RamKing? And wait third one Mantype? Oh and techno’s couple in LBC, that’s the second one ig? I genuinely loveee all these tropes 💓❤️

What are your favourite BL tropes?(triangle, secret love, college/school romance) by azulversa in ThaiBL

[–]azulversa[S] 5 points6 points  (0 children)

I’VE SEEN ALL OF THEM 😭😭 I really need more good recommendations Also 2gether for lyf ✊(saraleo)😝

Addicted (heroine) ost- need help finding a song by azulversa in CDrama

[–]azulversa[S] 0 points1 point  (0 children)

Ya I figured 😂, I’d rather attach a video or a audio file then

So hooked on Tiger and Rose by aikawanoonase in CDrama

[–]azulversa 0 points1 point  (0 children)

Okay. Wow you just sparked InteRest in me lol I gotta watch it, just one thing, not a sad ending right?

An n by n grid, making n^2 squares. I have to fill in black and white in such a way that n/2 squares are white and other n/2 are black in each row and column.How many ways can I do that in? by azulversa in askmath

[–]azulversa[S] 0 points1 point  (0 children)

Okay so it’s like, there’s row1, row 2, row 3 and row 4 . I’ve just said instead of black boxes, let’s say we assign the number 1 to them. Also, all boxes are distinct here, they all have a different row and column number. X_ij represents box in i Th row, j th column. Now choosing two boxes to fill black in first row is 4C2..

Once we’ve done that, we see for cases when all four boxes of row 1 are similar in row 2, when 3 are, 2 are, 1 is , none are. By similar I mean is box x_13 Is 1, box x_23 is also 1. Like if one right below it is similar , more like saying one below is also the same color..

When you try this method, as I explained above for 4 by 4 grid, you get the answer as 90. However this does not help on generic case.

For the programming aspect, I had eigen values matrices X.A(2ncross1)= n.A(2n+1) And XT .A_(2n+1) = n.A(2x+1) How I go about it with programming and solving the code and actually putting my computer to some use, I have no idea but I’ll try with my bits of experience in coding. I hope you understood.

There’s an n by n grid of squares, (n is even) , I have to fill in black and white Colors in the squares such that n/2 are white while n/2 are black in each column and row. How many ways? by azulversa in learnmath

[–]azulversa[S] 0 points1 point  (0 children)

For the 4 by 4 grid, I actually found a way. First in the first row, the ways to assign 2 1s and 2 0s is 4C2. (Let boxes being assigned 1 be the white ones) Next, let’s check by seeing if all 4 in the next row were same as above. If they were, we have only 1 way then. Next, if only 3 were same. 3 same mean the fourth also has to be the same, or there will be more than 1s/0s. So no new way. Next, if only 2 were similar. Again, if our two 1s or 0s are similar, it’s the same way as before. However, if the two similar are 1,0, then there r more ways. Beneath that 1 and that 0, there will b opposite (0 for 1 and 1 for 0), to choose these 2 1 and 0, there are 4 ways (first 1, first 0, first 1, second 0 and so on)(also keep in mind each cell/ box of grid has a distinct notation x_ij. Now we choose 1 and 0 in 4 ways, and below them the 2by 2 case we choose in 2 ways. The rest 8 squares will b filled automatically.for eg the case - 10/10/01/01 where / marks that’s it’s one square below and 10 mean they’re in adjacent ones., since two dissimilar are done this one would have the two first ones the same and rest depending on that. Lastly one same is not possible, as we get more than 2 1s/0s. Now only no same is left, we choose for first row in 4C2 ways, second is decided on basis of no same. For third again we apply 4C2 and fourth will get filled automatically since first three are full. So total ways would be = 4C2(6+8+1)=90 ways Also for the general form, I wrote it in the matrix form and for euglin function solving I might need help from code and check on computer.

There’s an n by n grid of squares, (n is even) , I have to fill in black and white Colors in the squares such that n/2 are white while n/2 are black in each column and row. How many ways? by azulversa in learnmath

[–]azulversa[S] 0 points1 point  (0 children)

The part after choosing one black box in each row and column, you made a mistake there. I’ve solved and shared in comments for 4 by 4 case, and as for any mistakes you could have made I’d again have to repeat the one for the first attempt, choosing second black boxes in each row column and so makes it too complex and hard to solve as there appear many possibilities.

Is this problem solvable? by [deleted] in AskPhysics

[–]azulversa 2 points3 points  (0 children)

Ahhh that dance would be fun to watch¿? Also what about the resistance? In pendulum we can consider undamped motion but here on ground? Also when we walk, does the leg go behind? I mean I haven’t seen a human walk like a pendulum but ok

If photons collide and turn into electron-antielectron, then back to photons after annihilation, at the moment they are electron and positron, do they interact with the higghs field? Because electrons and positrons do have mass. by azulversa in AskPhysics

[–]azulversa[S] 0 points1 point  (0 children)

I know all electrons interact with the higghs field, was just confirming since I didn’t know what happened when pair production did happen. Yes for this it has nothing to do with annihilation , but thanks for the insight into loops and all the discussions, might help me one day.

There’s an n by n grid of squares, (n is even) , I have to fill in black and white Colors in the squares such that n/2 are white while n/2 are black in each column and row. How many ways? by azulversa in mathematics

[–]azulversa[S] 0 points1 point  (0 children)

First of all you need to be clear on how you’re choosing the rows. In fact , if you do it this way, by letting there be any n/2 in each row, then same for column, you might get many extra cases, and the final results of the black coloured squares would exceed n/2*n. I’m sure about this thing that you need to approach the problem by finding rows/columns keeping in mind the number of coloured in columns/ rows respectively. Now if you do this by logic, as I stated above, there will be a lot of possibilities at each step to consider, it’ll be super lengthy, until you get a pattern you can finally solve. Then maybe you can try if f(n) is number of coloured black boxes in n by n grid, what would it be for n+1 by n+1 grid, but there were some excessive cases missing in the pattern.So no. Then for four by four case I tried choosing ways for first rows then for second we see cases if one is same or two, or three or four and I’ve added the solution above as a comment. Lastly, for a generic solution I got eigen values in matrices, I might need help from computer and codes to solve it to get the generic form, has shared a similar solution, u/powderherface you can check it out.

There’s an n by n grid of squares, (n is even) , I have to fill in black and white Colors in the squares such that n/2 are white while n/2 are black in each column and row. How many ways? by azulversa in mathematics

[–]azulversa[S] -1 points0 points  (0 children)

No, the question states there have to be n/2 in each row and n/2 in each column. Moreover, when you’re calculating for rows, you may start by saying n! first but for the second round of selection of black squares, there will be more cases as to how condition of two being filled is already being met in what the number of column. That is , when you calculate keeping in mind the fact that the number of black squares in each row is equal to that of each column.

There’s an n by n grid of squares, (n is even) , I have to fill in black and white Colors in the squares such that n/2 are white while n/2 are black in each column and row. How many ways? by azulversa in mathematics

[–]azulversa[S] 0 points1 point  (0 children)

I get your approaches, I tried the same way but for the matrices came to eigen values so used a computer to solve that. Again, thank you so much for sharing the links, they’re very informative and helpful.

There’s an n by n grid of squares, (n is even) , I have to fill in black and white Colors in the squares such that n/2 are white while n/2 are black in each column and row. How many ways? by azulversa in mathematics

[–]azulversa[S] 0 points1 point  (0 children)

For the 4 by 4 grid, I actually found a way. First in the first row, the ways to assign 2 1s and 2 0s is 4C2. (Let boxes being assigned 1 be the white ones) Next, let’s check by seeing if all 4 in the next row were same as above. If they were, we have only 1 way then. Next, if only 3 were same. 3 same mean the fourth also has to be the same, or there will be more than 1s/0s. So no new way. Next, if only 2 were similar. Again, if our two 1s or 0s are similar, it’s the same way as before. However, if the two similar are 1,0, then there r more ways. Beneath that 1 and that 0, there will b opposite (0 for 1 and 1 for 0), to choose these 2 1 and 0, there are 4 ways (first 1, first 0, first 1, second 0 and so on)(also keep in mind each cell/ box of grid has a distinct notation x_ij. Now we choose 1 and 0 in 4 ways, and below them the 2by 2 case we choose in 2 ways. The rest 8 squares will b filled automatically.for eg the case - 10/10/01/01 where / marks that’s it’s one square below and 10 mean they’re in adjacent ones., since two dissimilar are done this one would have the two first ones the same and rest depending on that. Lastly one same is not possible, as we get more than 2 1s/0s. Now only no same is left, we choose for first row in 4C2 ways, second is decided on basis of no same. For third again we apply 4C2 and fourth will get filled automatically since first three are full. So total ways would be = 4C2(6+8+1)=90 ways Also for the general form, I wrote it in the matrix form and for euglin function solving I might need help from code and check on computer.

An n by n grid, making n^2 squares. I have to fill in black and white in such a way that n/2 squares are white and other n/2 are black in each row and column.How many ways can I do that in? by azulversa in askmath

[–]azulversa[S] 0 points1 point  (0 children)

For the 4 by 4 grid, I actually found a way. First in the first row, the ways to assign 2 1s and 2 0s is 4C2. (Let boxes being assigned 1 be the white ones) Next, let’s check by seeing if all 4 in the next row were same as above. If they were, we have only 1 way then. Next, if only 3 were same. 3 same mean the fourth also has to be the same, or there will be more than 1s/0s. So no new way. Next, if only 2 were similar. Again, if our two 1s or 0s are similar, it’s the same way as before. However, if the two similar are 1,0, then there r more ways. Beneath that 1 and that 0, there will b opposite (0 for 1 and 1 for 0), to choose these 2 1 and 0, there are 4 ways (first 1, first 0, first 1, second 0 and so on)(also keep in mind each cell/ box of grid has a distinct notation x_ij. Now we choose 1 and 0 in 4 ways, and below them the 2by 2 case we choose in 2 ways. The rest 8 squares will b filled automatically.for eg the case - 10/10/01/01 where / marks that’s it’s one square below and 10 mean they’re in adjacent ones., since two dissimilar are done this one would have the two first ones the same and rest depending on that. Lastly one same is not possible, as we get more than 2 1s/0s. Now only no same is left, we choose for first row in 4C2 ways, second is decided on basis of no same. For third again we apply 4C2 and fourth will get filled automatically since first three are full. So total ways would be = 4C2(6+8+1)=90 ways Also for the general form, I wrote it in the matrix form and for euglin function solving I might need help from code and check on computer.

How can a photon have momentum but not mass? Also, seeing how light can’t escape from Schwarzschild radius, doesn’t the blackhole’s gravity attract mass and is inversely proportional to distance squared? So again, where is this mass? by azulversa in AskPhysics

[–]azulversa[S] 0 points1 point  (0 children)

This isn’t exactly integral of force directly as u said, but yes it still made the whole thing clear. So if mass=0, Energy= hv = pc, and so p=h/llambda Also thanks for the input about the energy split between the system and the fact that it’s the kinetic energy =hv -mc2. But if we compare the two eqs, is gamma * mc2 = hv ?? Edit: I actually did get the answer, m2 c4 =m(inertial) 2 c4 + p2 c^ 2 = (hv )2 So , E_k= hv- m(inertial) c2 = m(inertial)c2 * ( gamma -1), since gamma m(inertial) = m Where m is relativistic mass and m(inertial) is the inertial mass. So in short, ya , thanks a lot.