Leaderboard
Popular Content
Showing content with the highest reputation since 07/16/13 in all areas

2 pointsIn our circles you may find A laugh, a wink, a grin But pressure us we'll likely snap And send away our kin. We don't do much, we go to pot Such simple ones are we But with your hand we take command Or from you we will flee.

1 point

1 point

1 pointIt looks like you're taking the first letter and essentially rotating it through the different positions while the other letters remain in the same order. I noticed that all the possible permutations begin with two letters that were next to each other in the original sequence (or in the first and last spot). For example, I don't think you can get a sequence starting with AC. So this does not seem to hold up.

1 point

1 pointAn oldie but a goody (IMO): ****************************** Fivewalled open house Shut my door and make it four. I know exactly who you are, Where you sleep, friends you keep. A loyal soldier out on tour I take my leaves overseas. So pin the gold upon my breast, Give me orders crossing borders.

1 point

1 pointThough seldom seen, I'm world renowned Ever in flight above the ground. Teeth chewing, gnashing in time gnawing on knots, shunning the find. My hands at the ready, arms at the stay Heart like the sun, burning away. Ears like a rabbit's, pinned to the side Listening close, far and wide.

1 point

1 point

1 pointI’m the acrobat at your command, Give me a turn, or put me on the stand. I’m the sentinel, doorman you need, Give me a go, a goahead from me. Hit me, poke me, nail me in your wake, Without my flips, weak knees would quake. I live in one state and travel to another, Sunny side up or fumble in the other.

1 point

1 pointThe answer should be 25. My "proof" is a brute force programming solution. I have a psuedocode c++ bruteforce solution. I can give the full version if requested. It takes a few seconds to brute force all possible paths. This might count as a proof, depending on if you trust the computer to be reliable. Basically what it does is it generates all possible paths, and then prunes as it goes along so the program dosen't take basically forever, or 6^27 moves. Now a proof will involve some theorems in graph theory, which I don't yet know all that well. Assume the XYZ plane void recursive_dumb_solution( A 3D cube,Position of X, Y, and Z of current spot,direction it went twice ago, direction it went to get here){ if traveled along a direction twice in a row, return to the above function. else if( x<0  x > 2  y < 0  y > 2  z < 0  z > 2) AKA if it exited the cube, return. else if(cube[x][y][z] == 1) AKA if visited spot already visited, then return. else{ //mark the current position of the cube as visited. cube[x][y][z] = 1; /////Moves in every direction possible. recursive_dumb_solution(cube, x+1, y, z, length+1,'x',prev_dir); recursive_dumb_solution(cube, x1, y, z, length+1,'x',prev_dir); recursive_dumb_solution(cube, x, y+1, z, length+1,'y',prev_dir); recursive_dumb_solution(cube, x, y1, z, length+1,'y',prev_dir); recursive_dumb_solution(cube, x, y, z+1, length+1,'z',prev_dir); recursive_dumb_solution(cube, x, y, z1, length+1,'z',prev_dir); cube[x][y][z] = 0; return; } }

1 pointHopefully this one has not appeared before... Suppose 27 identical cubical chunks of cheese are piled together to form a cubical stack, as illustrated below. What is the maximum number of these cheese chunks through which a mouse of negligible size could munch before exiting the stack, assuming that the mouse always travels along the grid of 27 straight lines that pass through the centers of the chunks parallel or perpendicular to their sides, always makes a 90 degree turn at the center of each chunk it enters, and never enters any chunk more than once?

1 point

1 pointWhat is the answer of (xa)(xb)...(xz)? The solution is contained in the video below https://youtu.be/CnHBE4SbRRs

1 pointGreetings, my name is Cody and I am new here in this forum. Nice meeting you all. Although I have never heard of it, I am actually quite curious about what it is!

1 point

1 point. What is the value of x If 1/2, 2/3, 3/4, 4/5, 5/6, 6/7, 7/8, 8/9, 9/10 then x/1000? x = 500,000 2. If 4 and 2= 26, 8 and 1 = 79 and 6 and 5 = 111. Then, what is 7and3?...410 3. What 3 positive numbers give the same result when multiplied and added together? 2 mis interpreted the Q 1,2,3 is correct 4. What number do you get when you multiply all of the numbers on a telephone's number pad? zero 5. Here is a light switch. Note the order of the positions. If the light is now at medium and it is switched 3922 times what will be the position of the switch? medium I assumed in the absence of additional info there were 3 positions . i.e low , med , high. any even number of flips will put the sw back on med 6. Can you arrange four nines to make it equal to 100. 99 9/9 8. If 1/2 of 5 is 3, then what is 1/3 of 10? 3.67 I envisioned 1/2 of 5 = 2 1/2 + 1/2 = 3; therefore 1/3 of 10 = 3.33 + 1/3 =3.367 9. 100 students entered college. 55 of them chose music. 44 of them chose sports. 20 of them chose both. How many of them chose neither music nor sports? 21 10. Four friends are going to a concert. When they arrive, there are only five seats together left in the theater. The manager will let all four friends in for free if one of them can tell her how many different seating arrangements are possible for four people with five empty seats. 120 5 seats taken 4 at a time 5 ! All four are let in free. Could you have given the correct answer? 120 5 seats taken 4 at a time 5 ! 12. At six o’clock the wall clock struck 6 times. Checking with my watch, I noticed that the time between the first and last strokes was 30 seconds. How long will the clock take to strike 12 at midnight? 5 hrs 59 1/2 minutes 13. There are several books on a bookshelf. If one book is the 4th from the left and 6th from the right, how many books are on the shelf? 9 14. John has been hired to paint the numbers 1 through 100 on 100 apartments. my bad 20 How many times he has to paint 8? 20 15. You have two books. One of them is upsidedown and the other is rotated so the top of the book is facing you. What is the sum of the first page in each book? 1 +1 16. There is a certain club which is for men only. There are 600 men who belong to this club and 5% of these men wear one earring. Of the other 95% membership, half wear two earrings and the other half wear none. How many earrings are being worn in this club? 600 17. Does a pound of gold or a pound of feathers weight more? feathers 18. There is a chain nailed to the wall. The chain is 10 feet long and the center of the chain dips down 5 feet from where each side of the chain is nailed to the wall. How far are the 2 ends of chain from each other? on the same nail 19.Little Johnny is walking home. He has $300 he has to bring home to his mom. While he is walking a man stops him and gives him a chance to double his money. The man says "I'll give you $600 if you can roll 1 die and get a 4 or above, you can roll 2 dice and get a 5 or 6 on at least one of them, or you can roll 3 dice and get a 6 on at least on die. If you don't I get your $300." What does Johnny do to have the best chance of getting home with the money? keep on walking 20. If you have 6 women and 2 friends, how many women do each of your friends get if the friends are two of the 6 women;i.e. women themselves , then each is entitled to herself, or one each/ If the two friends are male then no women.

1 point. What is the value of x If 1/2, 2/3, 3/4, 4/5, 5/6, 6/7, 7/8, 8/9, 9/10 then x/1000? x = 500,000 2. If 4 and 2= 26, 8 and 1 = 79 and 6 and 5 = 111. Then, what is 7and3?...410 3. What 3 positive numbers give the same result when multiplied and added together? 2 4. What number do you get when you multiply all of the numbers on a telephone's number pad? zero 5. Here is a light switch. Note the order of the positions. If the light is now at medium and it is switched 3922 times what will be the position of the switch? medium 6. Can you arrange four nines to make it equal to 100. 99 9/9 8. If 1/2 of 5 is 3, then what is 1/3 of 10? 3.67 9. 100 students entered college. 55 of them chose music. 44 of them chose sports. 20 of them chose both. How many of them chose neither music nor sports? 21 10. Four friends are going to a concert. When they arrive, there are only five seats together left in the theater. The manager will let all four friends in for free if one of them can tell her how many different seating arrangements are possible for four people with five empty seats. 240 All four are let in free. Could you have given the correct answer? 240 12. At six o’clock the wall clock struck 6 times. Checking with my watch, I noticed that the time between the first and last strokes was 30 seconds. How long will the clock take to strike 12 at midnight? 5 hrs 59 1/2 minutes 13. There are several books on a bookshelf. If one book is the 4th from the left and 6th from the right, how many books are on the shelf? 9 14. John has been hired to paint the numbers 1 through 100 on 100 apartments. 11 How many times he has to paint 8? 11 15. You have two books. One of them is upsidedown and the other is rotated so the top of the book is facing you. What is the sum of the first page in each book? 1 +1 16. There is a certain club which is for men only. There are 600 men who belong to this club and 5% of these men wear one earring. Of the other 95% membership, half wear two earrings and the other half wear none. How many earrings are being worn in this club? 600 17. Does a pound of gold or a pound of feathers weight more? feathers 18. There is a chain nailed to the wall. The chain is 10 feet long and the center of the chain dips down 5 feet from where each side of the chain is nailed to the wall. How far are the 2 ends of chain from each other? on the same nail 19.Little Johnny is walking home. He has $300 he has to bring home to his mom. While he is walking a man stops him and gives him a chance to double his money. The man says "I'll give you $600 if you can roll 1 die and get a 4 or above, you can roll 2 dice and get a 5 or 6 on at least one of them, or you can roll 3 dice and get a 6 on at least on die. If you don't I get your $300." What does Johnny do to have the best chance of getting home with the money? keep on walking 20. If you have 6 women and 2 friends, how many women do each of your friends get if the friends are two of the 6 women;i.e. women themselves , then each is entitled to herself, or one each/ If the two friends are male then no women.

1 point

1 point

1 point

1 point

1 point

1 point

1 point

1 pointAl, Bert, and Charlie competed in a track and field event in which points were awarded for 1st, 2nd, and 3rd, place only. At the end of the day, Al had accumulated 22 points, while Bert and Charlie each garnered only 9 points. No other competitor earned points. Bert was 1st in the shot put. Who finished 2nd in the javelin throw? This is a Gold star puzzle.

1 point

1 pointUse the twelve pieces on the left to create a chess board, The pieces may be flipped!

1 pointEDIT: For clarity, I use "number" to reference an individual digit. I use "sequence" to reference the string of numbers. EDIT2: Added spoiler tag.

1 pointPerhaps your question may hinge on the source of variability. Pistol has 57. In any skirmish, is the choice between 5, 6, 7 made by the program randomly? Or does it depend upon distance to target? Or visibility ( like heavy, light or no fog)? And, as Pickett points out, damage radius is a key parameter of the Dupuy lethality index.

1 point

1 point

1 point

1 pointYou are shown a pile of dimes all of which have one of two distinct weights differing by a small amount not detectable by feel. Forty eight dimes are separated from this pile and you are told of these forty eight, light ones are a dime a dozen (literally  i.e. 44 heavy dimes and 4 light dimes). Using a balance scale twice, find seven heavy dimes. EDIT: for clarification

1 point

1 pointTen years ago I called attention to a number that when divided by a single integer p it left a remainder of p1. (Help, a remainder is chasing me) Here is a chance to construct a ninedigit number, a permutation of { 1 2 3 4 5 6 7 8 9 } that has no remainders, sort of. The task is to permute { 1 2 3 4 5 6 7 8 9 } to create a number whose first n digits is a multiple of n for any singledigit n. For example, consider 123654987. Its first 2 digits (12) are divisible by 2. It's first 5 digits (12365) are divisible by 5. However this is not a solution, since 1236549 is not a multiple of 7.

1 pointA joke from the internet yesterday: Trump really delivered when he said he would run the government just like his businesses. It's already shutdown! Don't worry, he still has three years to bankrupt it.

1 point

1 pointDoes the Indy trap appear even if it doesn't save anyone from actual death? Can they act on themselves? Do the goodie save and the Indy trap appear identically in the night post?

1 pointSignups: 1. Gavinksong2. Flamebirde3. Nana774. plasmid5. phil18826. bonanova 7. aura8.9. 10.11.12 I've just moved, to Ohio, from NY and drowning in the details of it. Reluctant to pledging my attention here. But, I'll give it a shot ... Should be able to check in at least daily.

1 point

1 pointSorry, something got lost in copying and pasting. The site does not like the formatting used in word, so I am attaching a picture of the solution ... apologies in advance.

1 pointimport java.util.*; public class lychrel { public static long palin(long n) { long m,p=0; while(n>0) { m=n%10; p=(p*10)+m; n=n/10; } return p; } public static void main(String ar[]) { long a,l,i,j=0,t,it=0; Scanner v=new Scanner(System.in); a=v.nextInt(); l=a+palin(a); t=palin(l); for(i=1;i<=10;i++) { it++; if(l==t) break; else { l=l+palin(l); t=palin(l); } if(i==4) j=l; } if(l!=t) { System.out.println(a+" is a Lychrel Number"); System.out.println("5th iteration of number "+a+" is "+j); } else System.out.println(it); } }

1 point

1 point@flamebirde because Molly was playing off of the word easy, which is a popular Commodores song. No other reason

1 pointHirk had to have been a goodie: baddie wouldn't target himself for a kill, and Indy can't be killed N1.

1 pointEdit  double post, so I thought I'd take this time to post a dancing monkey gif. Enjoy.

1 pointPlayer A has one more coin than player B. Both players throw all of their coins simultaneously and observe the number that come up heads. Assuming all the coins are fair, what is the probability that A obtains more heads than B?