Is it possible to run a 3 (condition) x 2 (time) MANOVA in SPSS? I think I found a way but here it is said that it is not possible to run a MANOVA in the mixed procedure (https://www.ibm.com/support/pages/manova-or-mancova-analysis-available-mixed-procedure-spss).
Thank you very much for your help!
Kind regards,
K.
Related
I am trying to do a paired sample t-test analysis with SPSS, but the column that should hold the two-tailed significance is split in two: "1 sided p" and "2 sided p". I do not know how to interpret this result. Please help me out.
I want to either get the result I am looking for, which is the two-tailed significance, or understand how to interpret the results I am getting, which is 1 sided p and 2 sided p. I'm not permitted to add images yet so here is a link to the report:
C:\Users\User\Documents\paired sample t test stack.png
Thank you in advance.
I tried to run the test about 4 times with different variables and tried clicking on other options before running the analysis but the result is the same.
I unfortunately don't have SPSS anymore and cannot see your link, but alas I have looked on YouTube and found a video that shows the output of a paired samples t-test for SPSS. Here is what they have and I have highlighted what I suspect your interpretation issue is:
Basically, SPSS by default gives you the result of a one-tail and two-tail test automatically without really saying which is "correct" (this is what "one-sided" and "two-sided" mean by the way). If you are only interested in testing if there is a significant difference in either direction (two-tailed), then you only use the two-tail test p value. So in your case, just ignore the "one-sided" p-value and use the "two-sided" p value instead.
I have another question here: Inspired Lua Program is Different on Computer and Calculator which answers this question. My attempt to mark as duplicate aged away.
I am writing a program for the Nspire CX CAS. I have a d2Editor mathbox that I would like to evaluate an expression I am giving it without using decimals. I would like it to simplify square roots and/or reduce fractions. How can this be accomplished?
I've spent around an hour looking through the wiki.
Thanks for any help you can offer.
Actually, no. I don't know if this is new but math.eval(expr) will evaluate expr as if you were running it from the tab calculator (Although still, if you have CAS disabled on your calculator, it will not be able to do use it)
math.eval('123+321=444') -> 'True'
Unless TI added new features recently, the answer is unfortunately that you will need to write it from scratch.
In a Lua program you do not have access to the representation that are used internally (say in a Notes workshop) to represent mathematical expressions.
You are handed, sigh, a string.
That means you will need to write your own parser for mathematical expressions in order to get a reasonable representation. Then you will need to write your own functions for manipulating and reducing expressions.
... no I am not kidding ...
I am facing a simple problem in Maxima: I want to calculate list of first derivatives of function / expression in various points. I know how to calculate list of "points" for normal expression:
float(makelist((x^2/sin(x-x/2),x,1,1000))
but when I run the expression through diff it changes expression to function and I don't know how to work with functions. I tried:
float(makelist(diff(x^2/sin(x-x/2)),x,1,1000))
which "zeroed" on me. Then I tried this:
float(makelist(''(diff(x^2)),x,1,1000))
which gives you right answer, but the result is not a number anymore. It's a list of something like:
[2.0 del(1.0), 4.0 del(2.0), 6.0 del(3.0), 8.0 del(4.0), ...
Would someone care to enlighten me about Maxima functions and numeric evaluation?
I know that this is a silly beginner's question, but I have never worked with Maxima before.
I think you want float(makelist(''(diff(x^2, x)),x,1,1000)) i.e. you need to write diff(expression, variable) instead of just diff(expression).
I am writing a program in assembly to calculate the modulus of a number. I do not need help with the the program, but I do need help understanding how modulo works with negative numbers. I have researched stackoverflow but I seem to be finding conflicting results.
Also, I would like to know how it works purely in mathematical terms, not as it relates to programming, just so I understand the basic concept. I did find this page semi-useful: Modulo operation with negative numbers However, the top two answers seem to be conflicting and now I have gotten myself even more confused with the difference between modulo vs remainders (based on the answers given on that page). Not to say that their answers are poor in any way, but at this point I seem to be having difficulty finding the forest through the trees.
Please help me answer these simple problems, and explain to to me in purely mathematical terms how you reached your answer. Also, I don't need to be explained the difference between modulo and remainder since I just seemed to become more confused when I looked at the webpage listed. Please explain it to me just in terms of modulus, and I can connect the dots from there ;)
Here are some examples:
-15 mod 2 = ?
15 mod -2 = ?
-4 mod 9 = ?
4 mod -9 = ?
-5 mod -9 = ?
Thank you in advance for your responses!
There is no clear convention for those cases.
Remember the formula for modulo is: n = am + b. Usually, it is required that the remainder b is within the interval [0..(m-1)]. This makes it very easy for all natural numbers.
For negative numbers, some conventions want the remainder to be in the interval [-(m-1)..0], some stick with above definition, and some take the solution where |b| is minimal.
Thus, you have to try the implementation the compiler or library developer chose.
Some programming languages have two operators to give you some freedom. Ada for example has rem and mod.
Behaviour:
In (n rem m) the remainder always has the sign of n, while in (n mod m), it takes on the sign of m.
The third convention, using the smaller remainder of the two, rarely is implemented.
I am trying solve this recurrence relations. I read a similar question in this site but it wasn't my answer.
T(n)=T(sqrt(n)) if n>4
T(n)=1 if n=4
thanks in advance.
According to your definition:
T(x) = 1 for all numbers of type 4^(2^n) for n being a natural number
T(x) not defined for all others