145 quant reasoning but 120 working memory on core
what is wrong w me im an iqlet I get an 11 sequential span when they're presented visually but for listening I cant pay attention at all and get like a 7 its so over
what is wrong w me im an iqlet I get an 11 sequential span when they're presented visually but for listening I cant pay attention at all and get like a 7 its so over
When are you first allowed to take it and when is the deadline? I haven't been able to find it.
I found this post interesting, and found that to get to higher even powers like n^4 all you need to do is sum the first n^2 consecutive odd numbers, just as for n^2 you would sum the first n. And this continues so that for any n^m you would just sum the first n^(m/2) consecutive odd numbers.
But for odd powers, it's a little more difficult. OP cut them into groups of size n and the sum of each of those groups resulted in n^3 (ex 1 = 1^3, 3 + 5 = 2^3).
I tried to find a procedure to get to n^5 but what I got was really weird so I dont think it's right. I split the consecutive odd numbers into groups just like for n^3 but this time in groups of size n^2 instead of n. What's weird tho is to get them into groups of this size that would sum to n^5 I had to skip some between the first and second and second to last and last in each group.
So where n=1, of course the group is just 1 which = 1^5.
For n=2, it would be 3, 7, 9, 13 (4 numbers in the group with 5 and 11 skipped) which sums to 32 = 2^5.
For n=3, it would be 15, 21, 23, 25, 27, 29, 31, 33, 39 (9 numbers in the group with 17, 19 and 35, 37 skipped) which sums to 243 = 3^5.
And for n=4, it would be 41, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 87 (16 numbers in the group with 43, 45, 47, 49 and 79, 81, 83, 85 skipped) which sums to 1024 = 4^5.
I repeated this again for n=5 and n = 6. I removed 6 consecutive odd numbers between the first and second in the group and 6 between the second to last and last for n = 5 and 9 for n = 6. Therefore the amount of numbers you would remove on each end of the group follows the pattern 0, 1, 2, 4, 6, 9.
Of course, this seems like a very unintuitive way to arrive at n^5. Is there a much easier way I'm missing and could that way be applied to higher odd powers?
EDIT: It's much simpler to just skip consecutive odd numbers between groups instead of trying to force the groups to start following the previous group's end.
The procedure would be to still keep the groups fixed at size n^2.
For n=2 it would be 5, 7, 9, 11 meaning we just skipped the 3 between this group and the previous group containing only 1.
n=3: 19, 21, 23, 25, 27, 29, 31, 33, 35 (we skipped 13, 15, 17)
n=4: 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79 (we skipped 37, 39, 41, 43, 45, 47)
So we skipped 0, 1, 3, and 6 numbers. Not sure what pattern there is here (maybe +1, +2, +3?).
Also this applies to higher odd powers of n. n^7 for example: when n=2 it can be reached by 9+11+13+15+17+19+21+23. We set the size of the group to n^3 and we skipped the 3, 5, and 7 between this group and the previous group containing only 1.
Are you limited to just 1 or can you request a suite-style dorm with multiple people?