text stringlengths 0 205 |
|---|
align:start position:0% |
wanted to solve and essentially what |
align:start position:0% |
wanted to solve and essentially what |
we've done is we've solved the problem |
align:start position:0% |
we've done is we've solved the problem |
align:start position:0% |
we've done is we've solved the problem |
for each individual sine NT so how do we |
align:start position:0% |
for each individual sine NT so how do we |
align:start position:0% |
for each individual sine NT so how do we |
get the full solution well what we have |
align:start position:0% |
get the full solution well what we have |
align:start position:0% |
get the full solution well what we have |
to do is we have to multiply the |
align:start position:0% |
to do is we have to multiply the |
align:start position:0% |
to do is we have to multiply the |
solution for each sign in T by a factor |
align:start position:0% |
solution for each sign in T by a factor |
align:start position:0% |
solution for each sign in T by a factor |
of 4 divided by PI and 1 over N and then |
align:start position:0% |
of 4 divided by PI and 1 over N and then |
align:start position:0% |
of 4 divided by PI and 1 over N and then |
we have to add all of these solutions up |
align:start position:0% |
we have to add all of these solutions up |
align:start position:0% |
we have to add all of these solutions up |
for all odd values of n |
align:start position:0% |
align:start position:0% |
so for example X is just going to be |
align:start position:0% |
so for example X is just going to be |
align:start position:0% |
so for example X is just going to be |
four over pi |
align:start position:0% |
four over pi |
align:start position:0% |
four over pi |
sum of n odd |
align:start position:0% |
sum of n odd |
align:start position:0% |
sum of n odd |
one over n times the solution to every |
align:start position:0% |
one over n times the solution to every |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.