This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
Messages - nemo
Pages: 1 ... 5 6 [7] 8 9 ... 82
91
« on: January 23, 2011, 09:21:11 pm »
f(X)=((X+1)+X/4)*(X<15)+(X+(X-1)/3+19)*(X>14)*(X<30)+((X+52)+X/2)*(X>29))
so is this a no-go or what?
92
« on: January 23, 2011, 07:33:02 pm »
if i'm traveling at a rate of 40 mph, my destination is 120 miles away and i've been traveling for two hours, how long until i reach my destination. just kidding you probably did that in your head as you read it. the real question is on the way, i'm currently solving it..
edit: the problem.
constituents:
2x2 matrix N
2x2 matrix P filled with ascending perfect numbers. i.e. if 1 2 3 and 4 were perfect numbers, P is [[1 2][3 4]]
2x2 matrix K whose values ascend just like P's, and is filled with only prime numbers, and the values when summed add up to 185.
Assuming P * K = N, what is the determinant of N? also, i want to see matrix P and K to check to make sure you solved the problem correctly. answers without P or K will be disregarded.
edit2: shoot i forgot! the determinant of K must be -2735...
K=[[2 43][67 73]] but P is not determined so how are we supposed to know what the determinant of N is?
P is defined as 4 perfect numbers in ascending order. a perfect number is a number whose factors sum up to the number itself. 6 is a perfect number. its factors are 1 2 and 3 which, when summed, equals the number itself: 6. ashbad, i'm confused about your question. storing data linearly then thinking about it as a 4x4x4 3D array for a math problem wasn't to my advantage so i discarded that portion. and you only listed 54 pieces of data so i really don't know where you got the number 64 other than 4 * 4 * 4 is 64. anyway. here's the function though i don't really deserve it. i just plugged in Xeda's equations and hope they work. f(X)=((X+1)+X/4)*(X<15)+(X+(X-1)/3+19)*(X>14)*(X<30)+((X+52)+X/2)*(X>29))
93
« on: January 23, 2011, 02:49:11 am »
Oh  I thought everybody was talking about random things because they had already solved a puzzle, i really haven't been keeping up
*hides*
haha no harm no foul. i checked this topic earlier wondering why it looked like randomness and now i just saw a new problem and was like "wait... it hasn't been 96 hours yet..."
94
« on: January 23, 2011, 02:45:51 am »
whoa, whoa. wait. what about my question? i guess you guys missed it
95
« on: January 22, 2011, 08:27:59 pm »
0->F
While -16
F->{*12+L6}
F+1->F
End
can't hurt to save a byte
OMG. That's insane!
I should just write it in ASM and post the hex.
xor a
ld (plotsScreen), a
inc a
ld (plotsScreen+12), a
inc a
ld (plotsScreen+24), a
inc a
ld (plotsScreen+36), a
inc a
ld (plotsScreen+48), a
inc a
ld (plotsScreen+60), a
inc a
ld (plotsScreen+72), a
inc a
ld (plotsScreen+84), a
inc a
ld (plotsScreen+96), a
inc a
ld (plotsScreen+108), a
inc a
ld (plotsScreen+120), a
inc a
ld (plotsScreen+132), a
inc a
ld (plotsScreen+144), a
inc a
ld (plotsScreen+156), a
inc a
ld (plotsScreen+168), a
inc a
ld (plotsScreen+180), a
cause screw loops.
96
« on: January 22, 2011, 06:44:35 pm »
0->F
While -16
F->{*12+L6}
F+1->F
End
can't hurt to save a byte
97
« on: January 22, 2011, 03:30:43 pm »
numbers whose factors sum up to the original number (excluding the number itself). 28's factors are 1, 2, 4, 7, 14. 1 + 2 + 4 + 7 + 14 = 28. 28 is a perfect number.
98
« on: January 21, 2011, 07:51:28 pm »
to insert:
[ADDRESS] .put the address into HL
Asm(EB) . ex de, hl
[SIZE]
Asm(EF42F7)
but it doesn't check if there's enough RAM, nor does it update the size of the variable you're updating.. so there are some issues... but it can't be hard to write an axiom for it.
99
« on: January 21, 2011, 07:19:56 pm »
if i'm traveling at a rate of 40 mph, my destination is 120 miles away and i've been traveling for two hours, how long until i reach my destination. just kidding you probably did that in your head as you read it. the real question is on the way, i'm currently solving it..
edit: the problem.
constituents:
2x2 matrix N
2x2 matrix P filled with ascending perfect numbers. i.e. if 1 2 3 and 4 were perfect numbers, P is [[1 2][3 4]]
2x2 matrix K whose values ascend just like P's, and is filled with only prime numbers, and the values when summed add up to 185.
Assuming P * K = N, what is the determinant of N? also, i want to see matrix P and K to check to make sure you solved the problem correctly. answers without P or K will be disregarded.
edit2: shoot i forgot! the determinant of K must be -2735...
100
« on: January 20, 2011, 10:42:43 pm »
K = [[5 93][17 53]]
M = [[13 11][ 19 17]]
101
« on: January 20, 2011, 10:25:48 pm »
alright, this is the closest i've come.
K:
[ 5 ][ 83 ]
[ 17 ][ 19 ]
M:
[ 13 ][ 11 ]
[ 19 ][ 17 ]
Product M * K:
[ 252 ][ 1288 ]
[ 384 ][ 1900 ]
i found 8 matrices which had 2668 as their last element (both MK and KM).
102
« on: January 20, 2011, 10:10:16 pm »
Actually, every prime is under 100.
that's good to know, now my program executes quickly... but to no avail, i cannot find the two matrices.
See my post edit just above yours.
one step ahead of you, i anticipated that possibility and already ran my program for KM, MK, KK and MM. could you define 2x2 matrix multiplication for us? [2, 5] * [11, 29] = [87 , 143]
[7, 9] [13, 17] [194, 356]
is this correct matrix multiplication?
103
« on: January 20, 2011, 09:59:30 pm »
Actually, every prime is under 100.
that's good to know, now my program executes quickly... but to no avail, i cannot find the two matrices.
104
« on: January 20, 2011, 09:28:46 pm »
Has anyone made any progress on this?
i'm just waiting for you to tell me if i should find the matrix within the first 1000 primes. i.e. i took all the matrices comprised of the first 1000 times whose determinant is 12 and multiplied them by all the matrices comprised of the first 1000 times whose determinant is -1316, and i still didn't get a product of N. is my program broke? or is it larger than that (in which case, i'm not wasting 10 minutes of my time waiting on the JVM to multiply primal matrices.)
105
« on: January 19, 2011, 04:39:00 pm »
question: why are axe and ti basic on the list if this is under computer programming?
Pages: 1 ... 5 6 [7] 8 9 ... 82
|
Show Posts
