Puzzle: If U got uneven array size N by N+1, & sum all the prime (1,2,3..)elements in that array. How to do in smallest code?
it's a little too twisted for me in the first 1/2 of the day 
sweetestsmiles
says
just some puzzles
sweetestsmiles
says
n by n+1 leh =)
sweetestsmiles
says
n by n+1!
sweetestsmiles
says
n can be any real number
sugiggs
says
lucky my current job doesnt require complicated algorithm logic hehehehe...
sweetestsmiles
says
=(
sweetestsmiles
says
u got n by n+1 array leh
sweetestsmiles
says
as from the first post
sweetestsmiles
says
lets take a number, n=5
sweetestsmiles
says
then n by n+1, is 5 by 6 which is an uneven array
sweetestsmiles
says
=)
sweetestsmiles
says
sum all the prime (1,2,3..)elements in that array
sweetestsmiles
says
any ideas?
sweetestsmiles
says
=)
sweetestsmiles
says
no find the elements in that array that are prime numbers
sweetestsmiles
says
and then add them up
sweetestsmiles
says
then use the smallest lines of code and implement =)
Hongster
says
1 is not a prime number. Can we make assumption on the range of number for each element?
sweetestsmiles
says
sorry , overlooked on that one