|
dude, that's pretty simple, but we're not here to do your homework for you.
you need to try and post what you tried and maybe we can give you pointers.
given the description you should first write a function that answers whether a number is prime or not.
then another function isJeffian that iterates over the given array and counts the number of primes in the array.
if that count is equal to the first argument of the array (and the first argument is prime) then it's a Jeffian array, so return true, otherwise return false.
"If your actions inspire others to dream more, learn more, do more and become more, you are a leader." - John Quincy Adams
|
|
|
|
|
Sorry.
I can't speak for any of the others here, but I personally could not see helping someone cheat their way into better grades, perhaps thus earning a degree (and job) they don't deserve, and can't sustain without relying on others to do their work for them.
It may be "tough love", but we're doing you a favor by NOT doing it for you. 
|
|
|
|
|
It's alright. He only has 10 minutes left before he fails. Harsh I know, but I will not condone cheating.
|
|
|
|
|
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.
|
|
|
|
|
thaaanks
but the exam ended .. and i will do my best in other exams 
|
|
|
|
|
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
|
|
|
|
|
The OP is trying to cheat on an online exam and is wasting time asking here rather than attempting to work it out for himself.
|
|
|
|
|
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.
|
|
|
|
|
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 find that Capo Ferro cancels Agrippa.
|
|
|
|
|
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.
|
|
|
|
|
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
|
|
|
|
|
i don`t know what i can say to you
but
Thank you think
|
|
|
|
|
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.
|
|
|
|
|
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.
|
|
|
|
|
Hi, i am making an app and im using postgre, so im making my connection with npgsql, but i need to make a report and im trying to use crystalreport, but i have no idea how to use crystal + npgsql. Can anyone help me please? thanks a lot
|
|
|
|
|
I have this RegEx - "BR[0-9][0-9][0-9]"
How do I modify it so that it works for "BR108" and "CC129" and only those?
Thanks
Everything makes sense in someone's mind
|
|
|
|
|
Luc Pattyn [Forum Guidelines] [My Articles] Nil Volentibus Arduum
Please use <PRE> tags for code snippets, they preserve indentation, improve readability, and make me actually look at the code.
|
|
|
|
|
I will answer this if you post it in the Regular Expressions forum.
|
|
|
|
|
I don't see a "regex forum? anywhere
Everything makes sense in someone's mind
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
