what the code of this
-
An array is defined to be a Jeffian array if it contains at least one prime number and the minimum prime number in the array is equal to the count of all the prime numbers in the array. Recall that a prime number is an integer greater than 1 whose only factors are 1 and itself. For example, the array {3, 6, 7, 10, 5} is a Jeffian array because: 1. it contains at least one prime number 2. its minimum prime number is 3 and that is the count of the number of primes (3, 7, 5) in the array
modified on Wednesday, January 26, 2011 5:20 PM
This is quite simple really:
- Take the inverse cosine of the dot product of the array and its transverse.
- Once you have this result, compare it to the sum of the edges of the numbers arranged into the indentity matrix multiplied by the primes of the original array arranged diagonally into a matrix.
- Once you perform that comparison, realize that it does you no good and that you should really focus on the assignment at hand rather than asking strangers on a forum to complete it for you. That's dishonest and stupid.
-
This is quite simple really:
- Take the inverse cosine of the dot product of the array and its transverse.
- Once you have this result, compare it to the sum of the edges of the numbers arranged into the indentity matrix multiplied by the primes of the original array arranged diagonally into a matrix.
- Once you perform that comparison, realize that it does you no good and that you should really focus on the assignment at hand rather than asking strangers on a forum to complete it for you. That's dishonest and stupid.
Oh for goodness sake. I didn't expect anybody to actually post the solution here. BTW, it's the log of the inverse cosine otherwise you end up with a nullity array.
I'm not a stalker, I just know things. Oh by the way, you're out of milk.
Forgive your enemies - it messes with their heads
-
An array is defined to be a Jeffian array if it contains at least one prime number and the minimum prime number in the array is equal to the count of all the prime numbers in the array. Recall that a prime number is an integer greater than 1 whose only factors are 1 and itself. For example, the array {3, 6, 7, 10, 5} is a Jeffian array because: 1. it contains at least one prime number 2. its minimum prime number is 3 and that is the count of the number of primes (3, 7, 5) in the array
modified on Wednesday, January 26, 2011 5:20 PM
-
not cheating but i ended the exam i can't answer three question :( now i want to know the code ... and wait the answer tomorro or after tomorrow not now :) calculating in programing difficult
Mohamed Nabawy wrote:
not cheating but i ended the exam
Suuuuure. Is that why you deleted the message you just had posted that said you had 30 minutes to go on your exam? If you have all this free time now, you would do yourself some good by solving this yourself. Perhaps you should go to your teacher if you are unable to provide a solution. I'm sure he/she would be happy to help you so that you don't fail again in the future.
-
Mohamed Nabawy wrote:
not cheating but i ended the exam
Suuuuure. Is that why you deleted the message you just had posted that said you had 30 minutes to go on your exam? If you have all this free time now, you would do yourself some good by solving this yourself. Perhaps you should go to your teacher if you are unable to provide a solution. I'm sure he/she would be happy to help you so that you don't fail again in the future.
-
cheat cheat cheat what i want help from you and you can't help me to depend on my self and i thanxs you i ended the exam and not passed if one can help me in any time not now i will thank him very much
do you really think we're that stupid? oh, wait, you're a cheater... so yeah, you do think we're that stupid.
"If your actions inspire others to dream more, learn more, do more and become more, you are a leader." - John Quincy Adams
-
Oh for goodness sake. I didn't expect anybody to actually post the solution here. BTW, it's the log of the inverse cosine otherwise you end up with a nullity array.
I'm not a stalker, I just know things. Oh by the way, you're out of milk.
Forgive your enemies - it messes with their heads
Ah, but you see the nullity array is cancelled out during the substitution phase. It's also important to keep the nullity array to preserve the equation's covariance, otherwise you end up with an unprovable postulate.
-
do you really think we're that stupid? oh, wait, you're a cheater... so yeah, you do think we're that stupid.
"If your actions inspire others to dream more, learn more, do more and become more, you are a leader." - John Quincy Adams
-
cheat cheat cheat what i want help from you and you can't help me to depend on my self and i thanxs you i ended the exam and not passed if one can help me in any time not now i will thank him very much
Look. It's easy. You have an array. Iterate over the array and check to see if each item is a prime. If it's a prime, increment your prime count and check to see if it's lower than any other primes you've found. At the end of the function, compare the count of primes with the lowest prime value. There are various optimisations that you can apply, but this is the basic functionality. If you want to have a career that doesn't involve flipping burgers then you need to apply critical thinking to problems. The question gave you all the information that you needed, but you chose to waste your time here rather than breaking the problem down into small steps.
I'm not a stalker, I just know things. Oh by the way, you're out of milk.
Forgive your enemies - it messes with their heads
-
Ah, but you see the nullity array is cancelled out during the substitution phase. It's also important to keep the nullity array to preserve the equation's covariance, otherwise you end up with an unprovable postulate.
Ah. I see you are applying Huffman's theory of indeterminate coexistence. An interesting theory, but as I only program in L space, completely useless in the 11th dimension. Still, it should suffice in a four dimension Euclidean universe.
I'm not a stalker, I just know things. Oh by the way, you're out of milk.
Forgive your enemies - it messes with their heads
-
just remember: cheaters never prosper, unless you work for WallStreet
"If your actions inspire others to dream more, learn more, do more and become more, you are a leader." - John Quincy Adams
-
Ah, but you see the nullity array is cancelled out during the substitution phase. It's also important to keep the nullity array to preserve the equation's covariance, otherwise you end up with an unprovable postulate.
I find that Capo Ferro cancels Agrippa.
-
cheat cheat cheat what i want help from you and you can't help me to depend on my self and i thanxs you i ended the exam and not passed if one can help me in any time not now i will thank him very much
For me, I'm glad you did not pass. As a mentor, I would not want to waste my time interviewing, never mind hiring, someone who wants to cheat on an exam, because these are the same people who will cheat in the workplace and life in general. Sorry if this sounds mean, but you got what you earned.
I wasn't, now I am, then I won't be anymore.
-
Oh for goodness sake. I didn't expect anybody to actually post the solution here. BTW, it's the log of the inverse cosine otherwise you end up with a nullity array.
I'm not a stalker, I just know things. Oh by the way, you're out of milk.
Forgive your enemies - it messes with their heads
and don´t forget to XOR the 13th and 17th element of the array
I cannot remember: What did I before google?
-
and don´t forget to XOR the 13th and 17th element of the array
I cannot remember: What did I before google?
Oh. I think we all took that as read.
I'm not a stalker, I just know things. Oh by the way, you're out of milk.
Forgive your enemies - it messes with their heads