I have a question that's asking me to take a 3 x 4 matrix and use the index $i, j$ of each entry to calculate the entries position in a 1 x 12 matrix.
I found the following formula which I think is correct: $n = i\times Ncol + j$ where i is the row number, j is the column an entry belongs to and Ncol is the total number of columns (also starting index from 0).
So that's an equation to find n in terms of i and j. But the next part of the question asks me to find equations for i and j in terms of n such that I can get the original position of the 2d matrix back and this is confusing me.
After Bacalauréat, you can do two year of Classes Préparatoire to then join an École d'ingénieur (for 3 or 4 years)
Some schools make this "classes préparatoires" thing something intern to their schools while others rely on the state to form their students who then take competitive exams to apply to the schools
@Semi @Steamy Turns out 10W isn't that much, and that the problem in lifting a ball with light is that, because of the intensity spectrum of the laser, the ball is not in a stable position and thus moves to the left/right
Searching in the transcript of this chat made me find this message
I'm suppose to give an example of an function with the period 200 degrees and amplitude of 2,5. I figured it to to be 2.5sin1.8x. I don't however understand why it is sin and not cos. @hi
Never seen sin(x+pi/2) = cos(x). Probably above my course since they don't seem to mention it in my textbook. OK, in that case that the answer should be both cos and sin but they choose sin in my textbook answer.
Consider a max heap tree with $100$ elements and a node from the same level is chosen randomly. What is the probability that it is the $36^\text{th}$ smallest element______ .
My attempt:
Somewhere, it explained as:
$P = (1/7 \cdot 0)+(1/7 \cdot 1/2)+ (1/7 \cdot 1/4) + (1/7 \cdot 1/8) + (1/7...
hi, i there is a problem with this question : i need to prove that for each $x \notin \Bbb Z$ the sum $\sum_{n=2}^{\infty} \dfrac{cos(2\pi n x)}{log(n)}$ converges. i think this is not true. am i right?
i need to find $\sum 1 / n \ ^ 2$ using $f(x) = x \ ^ 2$ (Fourier series) , in the interval $[-0.5,0.5]$ but im getting that the coefficients is zero because $\int_{-0.5}^{0.5} x ^ 2 e \ ^{-2\pi in x }dx = 0$ where is my mistake ?
Given two Zariski-closed subgroups $G$ and $H$ of $GL(n,\mathbb{C})$ as embedded into $\mathbb{C}^{n^2+1}$ via $A \mapsto (A,\det(A)^{-1})$. If $G$ and $H$ are isomorphic as abstract groups, are they isomorphic as algebraic groups, i.e. is there an isomorphism $f \colon G \to H$ such that $f$ and $f^{-1}$ are defined by polynomial functions? If not, what is a counterexample?
$\int_{-0.5}^{0.5} x \ ^ 2 e \ ^ {-2 \pi i nx} = \dfrac{e \ ^ {-2pi i nx } }{-2 \pi n } x \ ^ 2 + \dfrac{1}{\pi i n} \int_{-0.5}^{0.5} x e \ ^ {-2 \pi i n x} dx $
first expression is between -0,5 and 0.5 and is zero , and the second one evaluates to zero too
Hi All. Now there's a bit more activity, I hope you forgive me reasking this: I'm having a lot of difficulty in attracting any interest to my questions. See e.g. math.stackexchange.com/… and math.stackexchange.com/… . Do you have any suggestions? Would questions like these be better on Math Overflow?
ok, so for $x = 0$ we have $0 = \dfrac{1}{12} - \dfrac{1}{4 \pi \ ^ 2} \sum \dfrac{1}{n \ ^ 2} + \dfrac{1}{\pi \ ^ 2} \sum \dfrac{1}{(2n-1) \ ^ 2}$. how can i make the last term nicer?
@BalarkaSen yes that's what I thought. I'm given a table that says type of axis, order, number. For the type "passing through edges" and order 4, the number is 6. I thought it would be 3
Comme je te l'ai dit, je fais de la recherche en raisonnement humain, et soit je suis complétement singlé (ce qui n'est pas à exclure) soit en faisant cela, je contribue de manière significative à facilter la vie de mes compratiotes
More geometry puzzles: $ABC$ be a triangle, and $E, F, D$ points on $AB, BC, AC$ such that if $P$ is the point of intersection of $AF, EC, BD$ then $\angle EPB = \angle BPF = \angle FPC = \angle CPD$ and $EP = FP = DP$. Calculate $\angle BAC$.
Consider a max heap tree with $100$ elements and a node from the same level is chosen randomly. What is the probability that it is the $36^\text{th}$ smallest element______ .
My attempt:
Somewhere, it explained as:
$P = (1/7 \cdot 0)+(1/7 \cdot 1/2)+ (1/7 \cdot 1/4) + (1/7 \cdot 1/8) + (1/7...
