How smart /sci/ truly is?
C because there is no correct answer.
>>8732891
but then C is correct so the probability is at least 25%
>>8732895
But what if there are multiple correct answers. Then the chance is increased.
Depends on what your definition of smart is.
>>8732884
Either A or D. The correct answer can be either of them, but not both.
It reminds me of the "self-referential quiz" that was posted here a while ago.
>>8733028
that doesn't really make sense though, A and D are the same answer. If either are correct then both are correct.
>>8733054
you are over-complicating the question
>>8732884
B. There are 4 options, 2 of them that give you the odds of picking 1 right out of 4.
2/4 = 0.5.
>>8733059
wrong, you are answering the meta-question
the rationally correct answer is 25%, but if you allow the stupidity of the meta question (technically two solutions are the same, and therefore correct) then the "answer" is 50% which is incorrect.
B
>>8733059
But if the correct answer is 50% then there is only 25% chance of correctly choosing it . hence its not 50%. There is no correct answer to this question
You should be able to solve this.
B. Either it is or it isn't.
>>8733095
Kek
>>8733068
5 obviously
>>8732884
C; having to guess is incorrect.
>>8732884
Time for an actual problem.
>>8733255
I think I actually know how to do this.
>>8733255
Suck my fucking dick
>>8733255
B-Baka!
You should be able to solve this.
>>8733260
>>8733262
>>8733268
Here's the definition of the Verlinde formula in terms of link invariants.
>>8733277
Thanks for clearing that up
>>8732884
You haven't defined what correctness means in the context of that question. Thus, you are making a nonsensical request.
>>8732884
what is the chance that I get doubles if I reply to this post?
>>8733295
so if we have a ring of any general nxn matrice, given we want a solution set that does not equal zero,
proper implies not the whole circle so you would just a
span{a}≠0 where it contains some Field F
I<F,I≠F
I≠{0}
>>8733480
really rusty correct me if i am wrong
In 3D space we define a cut between 2 points as an area which passes through the line which connects 2 points.
Given 2n points, what is the maximum number of cuts a plane can make?
You should unironically be able to solve this.
>>8733503
if you can place the points arbitrarily, [math]n^{2}[/math]
>>8733068
I like how this is the same answer for both horizontal and vertical
>>8733271
Which case are we using?
>>8733271
Use angle of twist to figure out torques in each case of the beam, and then use the torques to construct a Torque diagram. Take pressures and find the max torque that can be at each part of the beam.