You are not logged in.
Bump.
So x[sup]2[/sup]=2 has no solution in the integers modulo 19. In other words, 2 is not a quadratic residue modulo 19, and we express this by saying
The Legendre symbol
is defined for integer a and odd prime p as follows.It can actually be proved that
which, for p=19, gives −1.
If we had known this before, we could have saved ourselves a lot of unnecessary work.
Try this:
http://frodo.elon.edu/tutorial/tutorial/
Or if you prefer a PDF file to download (which is what Ive done):
http://frodo.elon.edu/tutorial/tutorial.pdf
Its a table displaying every multiplication result in the set. For example, for
, itsFor
:So do you know how to construct a multiplication table for
now?Id love to go and live in Iceland. Spectacular mountains, glaciers, volcanoes, geysers
Then its 2 3 5 the first three prime numbers. That takes us to the first 18 decimal places: e = 2.718281828459045235
Ill make it simpler. Ill prove instead that
Now everyone should get it. This was precisely what my first fakse proof was all about; the differentiation was redundant, intended no more than to throw you off and make the error less obvious.
An equilateral triangle is one possibility. But there might be others, of course.
[Alt Gr] is the same as [Alt]+[Ctrl].
Im sorry, but I dont really like it.
What your proof needs is a bit more organization of thought. First, you focus on what are you trying prove. What are you trying to prove? Namely, that if S is a member of P(A) then S is a subset of P(A). Then you think of how to go about proving it. For this particular problem, its absolutely straightforward. Namely, you assume S ∊ P(A), and then you try, by a series of deductions, to arrive at S ⊆ P(A).
In general, when you want to prove a statement of the form P ⇒ Q, you can use one of three methods. (i) The most straightforward way is to assume P and then, by a series of deductions, try and arrive at Q. (ii) You can also assume that Q is false and show that this would lead to P being false. This is known as a contrapositive proof. (iii) The third method is proof by contradiction. Assume that P is true but Q is false, then show that this would lead to a contradiction.
For this particular problem, method (i) is the one to use. Whats more Ive already shown you how to do it (see above).
EDIT: Maybe Ill explain part of my proof in more detail. Up to S ⊆ A should be straightforward. Now S ⊆ A means S is a set of members of A. But A has property that each of its members is also a subset of A. Since the members of S are members of A, we see that the members of S are all subsets of A. So S is a set of subsets of A. Now carry on with the proof.
I like both mathematics and language.
Excellent job.
Now someone try #1? Its not that difficult.
A statistic like top 20% or top 10% would be much more relevant when theres a much larger group (say, 100 or more). 6 is really too small a group.
I remember a school teacher of mine used to use
Son Of Hercules Came At Houses To Offer Apples
At the moment, Im listening to the first three movements of Mahlers Symphony № 3 in D Minor.
Ganesh, I tried to make things as obscure as I could lol
And you certainly succeeded.
Oh geez, I misread the question.
Remember, there are no stupid questions, just stupid people.Mr Garrison, South Park
Im not very sure of my answer but that was what I got.
How do I calculate the top 20% highest grade for the following students:
A got 99
B got 93
C got 91
D got 85
E got 60
F got 50
For six people, the top 20% is the top [0.2×6] = [1.2] = 1 people (or rather person). ([x] denotes the greatest integer less than or equal to x.)
So only 1 person in the any group of 6 people can be in the top 20%; in this case, its A.
Correct.
Well, youre on the right track with your answer to #2, but you need to elaborate just a little bit.
Im intending to use this thread to post some interesting exercise questions on various math topics (and various math levels); some of the questions will be interrelated. Thus Ive posted my first three exercise questions.
Two integers are said to be relatively prime iff their highest common factor is 1. Thus, 2 and 5 are relatively prime, as are 4 and 9.
A result called Bézouts identity states that if a and b are nonzero integers that are relatively prime, there exist integers x and y such that ax + by = 1. {Note that x and y can be negative as well as positive.)
1. Consider the number 60. 60 is divisible by 4 and 5, and 60 is also divisible by 4×5 = 20. However, 60 is divisible by 4 and 10 but not by 4×10 = 40. 4 and 5 are relatively prime, whereas 4 and 10 are not.
Using Bézouts identity (or otherwise) prove that if an integer c is divisible by both a and b, where a and b are nonzero, relatively prime integers, then c is also divisible by the product ab.
2. Prove that the product two consecutive even numbers is divisible by 8.
3. Hence (or otherwise) prove that if n is an odd integer that is not divisible by 3, n[sup]2[/sup]−1 is divisible by 24.
Youre welcome. Can you follow the proof all right?