The Maths Topic

It was in a past challenge: do all 4 operations with numbers bigger than 5 digits or so (writerscube was in it, but I can’t really find it right now).
Some other also tried to go by the powers of 2, and didn’t manage to get to his usual big numbers.
I’m guessing math is a good way to get the left hemisphere (rational thinking) back in gear before starting the real LD, so you can have more control and stability ;D

So if I give you a formula, do I get a cookie recipe?

Let’s see. 2 * 3 * 2^2 * 5 * 2 * 3 * 7 * 2^3 * 3^2 * 2 * 5=
2^8 * 3^4 * 5^2 * 7
I want to say it’s just 953*2 .

Here’s a math-related puzzle. You’ll have to think very creatively to solve it. I lol’d when I found the secret.

Draw that without lifting your pencil, going over a line twice, or manipulating the paper (i.e. folding it).

Well I’ll just give you 2 cookies, beacuse you didn’t explain the formula. :cookiemon: :cookiemon: That makes three cookies for a single problem, you should be more than happy :lol: I’ll demonstrate it in your place.

We have a number of prime divisors, (namely 2, 3, 5 and 7), each wth his own exponent, and to form a divisor, we can combine any available power of those divisors freely. We can take 2^3, 3 and 5 to form 835=120, take only 2^7 and form 128, and so on.

To form all possible divisors, we just have to multiply all possibilities for each prime divisor, and if that divisor has n as its maximum exponent, that means we have n+1 choices for it. (IE for 5^2, we can ignore it and take 5^0, take a single 5, or take both and get 5^2=25, three total choices). Multiplying all choices (that are completely independent) we get (8+1)(4+1)(2+1)(1+1) = 9532 = 270 total divisors. (Notice how it is completely irrelevant from the kind of prime divisors we have)

It is indeed mathematically impossible to do it the standard way, because there are 4 points from which an odd number of lines is leaving. (And the maximum number to make it possible is 2). So, we could draw extra lines here and there to help us, perhaps over another paper so we don’t ruin the drawing. Is it so? :tongue:
But if you didn’t say not to fold the paper, I would have immediately thought of it first :tongue:

Actually, I was just going for “it’s impossible.”

I found this one…

uppsidedown L = gamma
gamma(n+1)=n!

read more on en.wikipedia.org/wiki/Gamma_function

I definitely think too hard into stuff. I seriously LOL’d when I saw your answer :rofl: [com]and what, no cookie? :smile: [/com]

Quite right, but we were talking more about a formula to calculate the munber of divisors of any given number :tongue:

Ok so, 2 problems are still up, feel free to add a 3rd one to the mix, or I will post one tonight.

2b) How many numbers of five digits (from 10000 to 99999) that are without zeros AND divisible by 12?

Not going to work on this until I’m actually awake, but I’d say it’s somewhere around 5,250. Close?

And fine, here’s your cookie. :cookiemon:

Moar liek 4000+.
I’ll give a little hint: 12= 3*4, and divisibility by 3 and 4 are easily studied. :wink:

EDIT: While we’re at it, https://en.wikipedia.org/wiki/Mathematical_joke

Man, I totally forgot to add a 3rd problem back. :lol:
1b) Geometry! ^^
If the circle has diameter 2, how much’s the coloured area?

If you give some love to math, it will give it back to you, squared :tongue:

I figured that one out with a little help from my math teacher, i50.tinypic.com/1jvlte.jpg
So the area is… wolframalpha.com/input/?i=hexagon+area
s is the radius, so of the the diameter is 2, s=1
Area=2.59808 cm^2 (or some other unit)

Congratulations! :cookiemon: I’ll post the solution for the 2b:

[spoiler]
First, a number is divisible by 3 if the sum of its digits is. EX. 297 is divisible because 2+9+7=18, 4568 is not becuase 4+5+6+8=23.
Secondly, a number is divisible by 4 is the last 2 digits are. IE. 12736 is divisible because 36 is.

Therefore, we can study the problem digit by digit.
So, let’s study the last 2 digits. The possibilities are 00, 04, 08, 12, … 88, 92, 96, and that makes 25 possibilities, without the 00, 04, 08, 20, 40, 60, 80, so that makes 18.
All other digits can range from 1 to 9, so that would make 9*9=81 possibilities for the 3rd and the 4th, then the 5th must be left for the divisibility by 3. You see, having only numbers from 1 to 9 to choose, it is much easier, as they are grouped 3 by 3 for the disision rest by 3: 3,6,9; 1,4,7; 2,5,8 are 3 groups of rest 0, 1, 2. This way, whatever the rest of the division by 3 of the sum of the other digits will be, we will always have the possibility to choose any of 3 digits IE. X3712 has rest 1 so far (like 3+7+1+2=13 has), so we can use either 2, 5 or 8; X8328 has rest 0 (like 8+3+2+8=21), so we can use 3, 6 or 9.

So, all numbers responding to all criteria are 18 * 81 * 3 = 4374 numbers.[/spoiler]

Feel free to add any problems, I won’t solve them :wink: and I probably won’t put up any until mid January.

How many consecutive zeroes are at the end of 100! (factorial) ?

You have two string-like fuses which burn in exactly 1 minute. However, the fuses do not burn at a constant rate and may burn quickly at first, then slowly, then quickly again, etc. You have a lighter. How do you measure 45 seconds without using a watch?

Can the mean of two consecutive prime numbers ever be prime?

[spoiler]24 zeros

I figure, ending in 0 gives you a 0 (so 10 of them)
Ending in 5 gives a zero as soon as it’s multipled to an even (another 10)
But, 25 was special, has 2 factors of 5, so 25, 50, 75 and 100 get an extra zero when multiplied to an even, (so another 4)

So, 24 zeros![/spoiler]

well, do decimal numbers count as prime?

(2+3)/2= 2.5

Well, i guess then yeah :tongue:

Only integer numbers can be prime. It’s a matter of divisibility, and divisibility loses its meaning if you can divide anything by anything without any reminder.
Besides, (solution)[spoiler] if two prime numbers are consecutive, that means there’s none inbetween, and that’s where the mean will always lie, in the middle :tongue: so it’s pretty much impossible.[/spoiler]

Hey, TosxyChor, how do you do that “Click Here” stuff? Good solution, I like it, makes sense.

After hearing the prime number answer, I thought “outside the box” on this one.

[spoiler]Take one fuse, and light both ends at the same time. It’ll burn up twice as fast, 30 seconds.

Take the other fuse, cut it in half, then light both ends of both halves when the first fuse is entirely burned up. It’ll burn 4 times faster, 15 seconds.

When both pieces of the second fuse are gone, 45 seconds will have gone by.[/spoiler]

Edit: This solution is wrong! But, I think I got it a few posts below this one.

Okay, so here’s a new one:

A death ray is mounted on top of a platform which rotates at a constant speed of one revolution per hour. Every 275 seconds the death ray is fired. Find the smallest value for the total number of times the death ray has been fired when the same spot is hit for a second time.

You can’t do that, because you don’t know where “half the duration” is, the rope is irregular and will burn at different rates.
However, it’s quite the right road, now how to make the second rope last 15 seconds after the first one has burned… :wink:

Plus, to make spoilers, just use the [spoiler] tag.

[spoiler]thing to hide[/spoiler]