Math Question(s)

[CM Punk]

Yeah, I didn't learn this shit in school or I didn't pay attention.

 

[CM Punk]

Still bet Xanth didn't know it. ipebomb:

 

[Coon]

Using the number 0 and no operators, get the number of people that didn't use google for the answer. Go.
My first thought was to use bit shifting and treating it as binary, but realised you'd need more than one operator and a few more digits.

If you want actual decent maths questions, use http://projecteuler.net/

 

[Jonathan]

Use 9 9 9 9 9 9

Make 1000. Use a max of 2 operators. (plus, minus, etc.)

 

[Jonathan]

Using the number 0 and no operators, get the number of people that didn't use google for the answer. Go.

My first thought was to use bit shifting and treating it as binary, but realised you'd need more than one operator and a few more digits.

Yeah I did think that 1: @ google

 

[the_hoff]

Bro, does this look like a classroom? No. So get outta here with that mathematical hoopla

 

[CM Punk]

I'm still trying to understand this whole thing, so someone else answer this.

 

[Jonathan]

You have 6 9's. Make 1000.

 

[Coon]

Two positive numbers A and B are said to be connected (denoted by "A ↔ B") if one of these conditions holds:
(1) A and B have the same length and differ in exactly one digit; for example, 123 ↔ 173.
(2) Adding one digit to the left of A (or B) makes B (or A); for example, 23 ↔ 223 and 123 ↔ 23.

We call a prime P a 2's relative if there exists a chain of connected primes between 2 and P and no prime in the chain exceeds P.

For example, 127 is a 2's relative. One of the possible chains is shown below:
2 ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127
However, 11 and 103 are not 2's relatives.

Let F(N) be the sum of the primes N which are not 2's relatives.
We can verify that F(103) = 431 and F(104) = 78728.

Find F(107).

 

[Jonathan]

OH HEL NO THIS MY CONTNET GTFO JOB!

 

[CM Punk]

You're a psycho.

 

[CM Punk]

Kidding, I'mma try this.

 

[Jonathan]

No one can get this. It's from project euler and a reliable source on Skype tells me you have to write a program to find solutions to problems on that site.

Jono 1
Coon 0

:maybe:

 

[Coon]

It's from projecteuler.net. They have a bunch of crazy complicated problems, and most require writing an actual program to do the calculations, because manual calculations would take too long.

 

[Coon]

No one can get this. It's from project euler and a reliable source on Skype tells me you have to write a program to find solutions to problems on that site.

Jono 1
Coon 0

:maybe:

who's the source