Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#176 Maths Is Fun - Suggestions and Comments » Error » 2018-01-30 03:48:23

Alg Num Theory
Replies: 5

I was trying post a new topic in the This is Cool section but I got the following message:

Forbidden

You don't have permission to access /post.php on this server.

Additionally, a 403 Forbidden error was encountered while trying to use an ErrorDocument to handle the request.

Why? neutral

#177 Re: Help Me ! » [ASK] Trigonometric Equation » 2018-01-30 03:23:56

I have an idea: if tanA·tanB = 1, then A+B must be an odd multiple of 90°. Example:

[list=*]
[*]

[/*]
[/list]

and 30° + 60° = 90°.

In the OP’s example, 0 < x < 90°, so 0 < (2x + 5) + (x − 5) = 3x < 270° ⇒ x = 90°.

PS: Check: tan(175°) = 1/tan(95°) so I think I’m on the right track. smile

#178 Re: Help Me ! » [ASK] Trigonometric Equation » 2018-01-29 03:39:45

Oops, that does not work. If tanAtanB = 1, then the denominator in the formula for tan(A+B) is 0.

Sorry, back to the drawing board …

#179 Re: Jokes » Very short jokes! » 2018-01-29 01:16:32

Q: What’s the difference between God and women?
A: God can make something out of nothing whereas women are always making nothing out of something.

#180 Re: Dark Discussions at Cafe Infinity » crème de la crème » 2018-01-28 12:20:12

269) Roger Federer

Roger Federer (German pronunciation: [ˈrɔdʒər ˈfeːdərər]; born 8 August 1981) is a Swiss professional tennis player who is currently ranked world No. 2 in men's singles tennis by the Association of Tennis Professionals (ATP). Federer has won 20 Grand Slam singles titles and has held the world No. 1 spot in the ATP rankings for 302 weeks, including 237 consecutive weeks. After turning professional in 1998, he was continuously ranked in the top ten from October 2002 to November 2016. He re-entered the top ten following his victory at the 2017 Australian Open.
https://en.wikipedia.org/wiki/Roger_Federer

Roger Federer won his sixth Australian Open and 20th Grand Slam title with a five-set victory over Marin Čilić.
The Swiss lost five games in a row as he dropped the fourth set but recovered to win 6-2 6-7 (5-7) 6-3 3-6 6-1.
Federer, 36, becomes only the fourth player after Margaret Court, Serena Williams and Steffi Graf to win 20 or more major singles titles.
"It's a dream come true and the fairytale continues," said Federer, who has won three of the last five majors.
http://www.bbc.co.uk/sport/tennis/42851064

5a669538220ae6aa726bf1e20e772011.jpg

Has there ever been, or will there ever be, a more fantastic tennis player than Rogerer Federer, winner of 20 Grand Slam singles title (and counting)?
http://speakforum.forumotion.com/t43-roger-federer

#181 Re: Help Me ! » I need the Mathematics science Branches » 2018-01-27 08:08:50

You mean what are the prerequisites for studying each math subject? What didn’t you say so then?

#182 Re: Help Me ! » I need the Mathematics science Branches » 2018-01-27 02:13:54

Your question makes no sense to me.  Branches of mathematics (or any other subject) are neither “sequential” nor complete: they don’t form any kind of order,  nor do they have a beginning and end. Well, maybe there is beginning, couched in the obscurities of prehistoric time, but definitely no end. New branches are cropping up all the time – for example, chaos theory and the study of fractals were unheard of before the 1960s. There are also topics (such as non-standard analysis and rational trigonometry) that are not universally accepted by mathematicians as valid branches of mathematics.

But if you think your question makes sense, then go and google it yourself – don’t be lazy.

#183 Re: Maths Is Fun - Suggestions and Comments » Pythagoras' Theorem in 3D » 2018-01-24 00:36:47

One of the best visual demonstrations of Pythagoras’s theorem I’ve ever seen was on QI a couple of years ago.

[list=*]
[*]https://www.youtube.com/watch?v=_e6w5GtkcGI[/*]
[/list]

#184 Re: Help Me ! » frequency spectrum analysis » 2018-01-22 20:28:42

A wave with a high frequency has a short wavelength, so its peaks and troughs are bunched up close together. One with a low frequency will have a longer wavelength, i.e. its peaks and troughs are more spread out.

#185 Re: Dark Discussions at Cafe Infinity » Breathing Trouble while Meditation » 2018-01-18 12:57:23

George,Y wrote:

Uh it is surprising to find so many mathematicians practice meditation!

People can be spiritual without being religious – http://www.bbc.co.uk/news/magazine-20888141.

#186 Re: Help Me ! » Arithmetic and Geometric Sequences » 2018-01-13 23:47:00

George,Y wrote:

Note the common ratio is a complex number.

It still works, provided the modulus of the common ratio is less than 1.

#187 Re: Help Me ! » Light bulbs and switches » 2018-01-13 03:36:07

For n ≡ 3 (mod 4), n is odd and the total number of switchings is even, which is impossible if each switch is to be flicked an odd number of times: the sum of an odd number of odd numbers must be odd. This is what you proved yourself in post #1.

For n ≡ 2 (mod 4), n is even and the total number of switchings is odd, again impossible as the sum of an even number of odd numbers must be even.

#188 Re: Help Me ! » Light bulbs and switches » 2018-01-12 18:03:18

So if n ≡ 2 or 3 (mod 4) it is never possible to have all lights on at the end. I will show that you can have them all on if n ≡ 0 or 1 (mod 4).

For n = 4, the process is simple:

0000
1000
1110
0000
1111

using bob bundy’s notation. Let us give this an easy-to-remember name and call it the “four-switch process”.

Now label the switches 1, 2, …, n. Suppose n is a multiple of 4. The first four people perform the “four-switch process” to the first four switches. The next four people then toggle the first four switches and perform the “four-switch process” to switches 5 to 8. Then switches 5–8 will all be on; since switches 1–4 are already on, toggling them an even number of times will leave them on. Hence after the first 8 people, switches 1–8 will be on. Then we can continue the process, persons 9–12 toggling switches 1–8 and doing the “four-switch process” to swtiches 9–12, and so on. Hence when n ≡ 0 (mod 4) it is always possible to leave all the lights on.

Bob was scratching his head over the case n = 5; let me put him out of his misery. smile

00000
10000
01000
11110
00000
11111

The first person turns the first switch on, persons 2–5 toggle the first switch and perform the four-switch process on switches 2–5. So if n ≡ 1 (mod 4) proceed as follows: persons 6–9 toggle the first 5 switches and do the four-switch process on switches 6–9, persons 10–13 toggle the first 9 switches and do the four-switch process on switches 10–13, and so on – leaving all lights on at the end.

#189 Re: Help Me ! » Light bulbs and switches » 2018-01-12 16:11:36

chen.aavaz wrote:

Total number of switchings by the n people: 1+2+…+n = n*(n+1)/2 = always even
For all lights to be on after the whole process, each of them must have been switched by an odd number of times.
So this is a sum of odd numbers, and if n:odd then the total is odd, which is contradictory with the above.

The total number of switchings is even if either n or n+1 is divisible by 4, otherwise (as in bob bundy’s example) it is odd.

However you have managed to show that if n ≡ 3 (mod 4) then it is never possible to have all lights on at the end. You still need to determine whether it’s still the case for other values of n.

PS: You can also argue in similar fashion that if n ≡ 2 (mod 4) then again it’s not possible. This time the total number of switchings is odd and n is even.

#190 Re: Help Me ! » Exponential problem » 2018-01-11 05:06:46

bob bundy wrote:

Can anyone assist with the following problem to find a where x = 0.85, k=1 and y = 11.2;

y=ae^-k*x

So 11.2 = a^(-0.85)

#191 Re: Help Me ! » Problem around modular arithmatic » 2018-01-01 06:42:55

Let me put this in that language of group theory. We have

[list=*]
[*]

[/*]
[/list]

because 58 is the order of G, the multiplicative group of nonzero integers modulo 59 (a prime). If

[list=*]
[*]

[/*]
[/list]

then m must be a multiple of r, the order of 10 in the group G. Now r must be a divisor of the group order |G| = 58, i.e. its possible values are 1, 2, 29, 58. In my posts above, I eliminated 1, 2, 29. Therefore r = 58 (i.e. 10 is generator of the cyclic group G).

#192 Re: Help Me ! » Problem around modular arithmatic » 2018-01-01 02:38:50

So there you have it:

[list=*]
[*]

[/*]
[/list]

#193 Re: Help Me ! » Problem around modular arithmatic » 2018-01-01 02:22:49

Since 59 and 9 = 10 − 1 are coprime, any solution to

[list=*]
[*]

[/*]
[/list]

is also a solution to

[list=*]
[*]

[/*]
[/list]

i.e. to

[list=*]
[*]

[/*]
[/list]

and vice versa. By Fermat’s little theorem, as 59 is prime,

[list=*]
[*]

[/*]
[/list]

Therefore the smallest positive value of n+1 must divide 58. Clearly 10 ≢ 1 (mod 59) and 10² = 100 ≢ 1 (mod 59). If you can show that

[list=*]
[*]

[/*]
[/list]

then n+1 will be a multiple of 58 and the general solution will be n = 58k − 1, k = 1, 2, 3, ….

#194 Re: Help Me ! » Recurrence in division » 2017-12-30 15:18:39


[list=*]
[*]

[/*]
[/list]



[list=*]
[*]

[/*]
[/list]


[list=*]
[*]

[/*]
[/list]

[list=*]
[*]

[/*]
[/list]

#196 Re: Maths Is Fun - Suggestions and Comments » Fourier Series » 2017-12-26 21:53:12

I think it looks great!

I'm not as au fait with Fourier series (and analysis topics in general) as I am with other, more algebraic areas of mathematics, so it's great to learn something new.

#197 Re: Help Me ! » Please Help! » 2017-12-19 17:16:54

What is the domain of the function f? It certainly cannot include 0, otherwise

Vedanti wrote:

f(3x)=f(x)+2 for all x

would imply 0 = 2 upon substituting x = 0. Please state the question more fully.

#198 Re: Dark Discussions at Cafe Infinity » whats 1+1? » 2017-12-16 01:53:26

This YouTube video may be Quite Interesting to you:

[list=*]
[*]https://www.youtube.com/watch?v=BE657F9sqyQ[/*]
[/list]

#199 This is Cool » Series of sums » 2017-12-11 23:02:08

Alg Num Theory
Replies: 0

[list=*]
[*]

[/*]
[/list]

[list=*]
[*]

[/*]
[/list]

[list=*]
[*]

[/*]
[/list]

[list=*]
[*]

[/*]
[/list]

[list=*]
[*]

[/*]
[/list]

#200 Re: Guestbook » Correct Answer to 12 Days of Christmas Puzzle » 2017-12-11 21:46:32

http://www.mathsisfun.com/puzzles/12-da … ution.html

It’s a partridge IN a pear tree, not partridge AND a pear tree. The tree provides a setting for the bird to be in and is not counted as a separate gift.

The solution is involves a sum of triangular numbers

[list=*]
[*]

[/*]
[/list]

where

[list=*]
[*]

[/*]
[/list]

Board footer

Powered by FluxBB