Feel free to add comments ...

Life is strong but yet fragile. It's a paradox. It's both things, like quantum physics:It's a particle and a wave at the same time!

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

$</code> ... <code>$</code>...<code>."> Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in $</span> ... <span>$ or $</span> ... <span>$ to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestThe first and most sensible question:-

Do you like carrots?

Log in to reply

not really,tell me do you like carrots?

Log in to reply

Hey Mehul , do you have quadro phobia?

Log in to reply

Hello Everyone!!!

Log in to reply

Hello!

Log in to reply

Hey

Log in to reply

Can you help me out with this?

Log in to reply

Do you like carrots?

Log in to reply

I too have great interest in quantum physics and relativity .Keep eating carrots like Nihar because you too have the same number of letters in your name as is in carrots.I hope that you might solve the conflict of gravity and quantum mechanics in future.

Log in to reply

so you want to do career in pure physics or something else?

Log in to reply

It is very difficult for me to answer this question because of my wide range of interest in subjects of Mathematics,Physics,Computer Science and Astronomy.

Log in to reply

which subject do you like other than mathematics and physics.

Log in to reply

Computer Science and Astronomy.

Log in to reply

Bonne journee is not literally used as 'good day' in francais. It's more like have a good day. Sorry to ruin it. :3

And potato or potato?

Log in to reply

Got it thanks for that bro .Actually i am learning German not french

Log in to reply

(http://shivamani patil)

Log in to reply

Chinmay Sangawadekar

Log in to reply

Sorry I was practicing to make the link . The blue one...

Log in to reply

I wanted to spam :P

Log in to reply

Please as you are a moderator do check this problem. Chinmay Sangawadekar

Log in to reply

Log in to reply

Still it is not getting the rating.

Log in to reply

Log in to reply

@Chinmay Sangawadekar, i see that you have interest in contributing to wikis like multiplicative functions and mobius function. talk to me at slack so we could make the wiki better.

Log in to reply

Brother , I have no access to slack , when I try , it says you are already invited , but I had deleted my emails already :( is there another way to communicate ? On Facebook ? @Aareyan Manzoor

Log in to reply

login here. i had the same problems....

Log in to reply

@Aareyan Manzoor

How is it ?Log in to reply

Log in to reply

Log in to reply

Log in to reply

@Dev Sharma

Yeah same here ,Log in to reply

https://crypto.stanford.edu/pbc/notes/numbertheory/mult.html , do check this out , it has many useful things which we can use for wiki

Log in to reply

cool, just went through it.... i was planning to include those sums....

Log in to reply

Log in to reply

Log in to reply

Log in to reply

@Chinmay Sangawadekar, lets talk about multiplicative function wiki first.

Log in to reply

okay ,

Log in to reply

go here for the wiki. what level audience do we target?

Log in to reply

Log in to reply

Log in to reply

Log in to reply

Log in to reply

Log in to reply

@Otto Bretscher , I wanted ask you about this

Does this mean , that n^{2015}=1 , ?

Log in to reply

Yes, "primitive root of unity" means that 2015 is the smallest positive integer $k$ such that $\omega^k=1$.

Log in to reply

@Otto Bretscher , can you tell me a general formula to find the product of totient of divisors of any number n

Log in to reply

@Isaac Buckley why did you choose Computer Sci. topic for this problem of yours ?

Log in to reply

Can you solve it using number theory?

Log in to reply

I dont know but problem looks like NT problem. Can you solve it by NT any tries ?

Log in to reply

Log in to reply

@Isaac Buckley

Oh yeah there is no specific formats for primes iant it?Log in to reply

I'd love to see anyone try to solve it with number theory, a great prize awaits them.

Log in to reply

Log in to reply

@Isaac Buckley

Really , well is there any generelization for primes,in such form ?Log in to reply

this

Log in to reply

$2^n-1$ is a possible prime only if $n$ is prime. That's all I can say about this form.

Well I'm not sure what you mean by that exactly.Something you might be interesting in reading up on is Mills' constant. It's a way to find primes. It has major short comings though, still interesting.

Log in to reply

Log in to reply

Log in to reply

$e+\pi$ is not proven to be irrational.

It is suprising how many numbers are yet to be proven irrational. for exampleLog in to reply

$e+\pi$ later tonight. It came up in a past exam paper I took. If mills' constant was rational the implications could be pretty big, you could possibly (by magic) find its exact fraction and thus generate as many primes as you want.

Yeah, I love problems like that. I might actually post a problem relating toLog in to reply

Log in to reply

Log in to reply

Log in to reply

@Isaac Buckley

You there ?Log in to reply

$2^n - 1$ a sure prime or is it not sure for prime $n$? @Isaac Buckley

IsLog in to reply

$2^n-1$ iss prime..... so no!

Only 49 n's have been found such thatLog in to reply

Log in to reply

$2^n-1$ is also composite.

It's just a prime candidate. Try and prove that if n is composite thenLog in to reply

Log in to reply

I didn't, I chose number theory which was then changed to computer science by a moderator. I do not contest to it, it fits well in computer science.

Log in to reply

@Aareyan Manzoor , @Nihar Mahajan , dont you think this is level 5 problem ?Somebody set level 3 for it.

Log in to reply

It is okay. it doesnt use any hard concepts.

Log in to reply

see thishttps://brilliant.org/problems/double-polynomials/?group=3Bg9df1xnfS9&ref_id=1094417 shouldnt it be lvl 5 ???

Log in to reply

I think it must be level 3 only. Also , you must mention what $\phi$ function is.

Log in to reply

Hey @Nihar Mahajan take a look at this I strongly feel that this problem should get level 5 (though it has no advanced concepts)atleast 200 or 195 points.Please do update the seed level.I will be very thankfull to you

Log in to reply

Log in to reply

@Chinmay Sangawadekar in the future please dont tag mods like this, if a mod comes across a problem he will change the level. By tagging you are bothering them, mods are usually busy.

Log in to reply

@Aareyan Manzoor see the link of problem

Log in to reply

@Nihar Mahajan , have you started learning limits ?

Log in to reply

I have finished it.

Log in to reply

Great What source ? M Prakash notes ? @Nihar Mahajan

Log in to reply

Log in to reply

@Nihar Mahajan

Hmm , so no school today for you ?Log in to reply

Log in to reply

this@Nihar Mahajan

Well ,also see my level two limits problem ,Log in to reply

Log in to reply

@Chinmay Sangawadekar

Solved it.Log in to reply

Log in to reply

Log in to reply

@Nihar Mahajan

Hey why dont you try and solve my NT and Algebra lvl 4-5 problems ?Log in to reply

@Chinmay Sangawadekar

Why don't you solve my all previous problems?Log in to reply

@Nihar Mahajan

I was doing them only I did many of your recent problemsLog in to reply

@Nihar Mahajan what is the teamdomain of brilliant on slack ?

Log in to reply

@Nihar Mahajan you may try this

Log in to reply

Thanks , I got it :)

Log in to reply

@Nihar Mahajan , can you update my solution number ? I have written 6 and deleted my previous one so , can you do that ? or tell any staff member to do so ?

Log in to reply

Sorry , I can't do that , you may ask Calvin on his messageboard.

Log in to reply

@Nihar Mahajan , you may also try this

Log in to reply

@Chinmay Sangawadekar You may try this , this .

Log in to reply

solved ,,sorry ,, saw your comment now ,, Nice problems ..

Log in to reply

@Nihar Mahajan try these problems ;) 1 , and 2

Log in to reply

@Abhishek Sinha , Sorry to mention you here , but I wanted to know more about the Mathematics Department of MIT Can I get in there ? What is the process to do so ? Please tell.. Also , what is your PhD topic ?

Log in to reply

You should apply. The application procedure is publicly available. I am working on Network Control and Information Theory. Good luck!

Log in to reply

@Otto Bretscher : Please see if it is true : We have , $a\equiv 1\mod b$ where , $(a,b)$ are consecutive natural numbers such that , $a> b$ , then , $a^{n}\equiv 1\mod bn$ , this congruence is true .

Log in to reply

No, this is not correct (unless I misunderstand your statement). As a counterexample, consider $n=2, b=3, a=4$.

Log in to reply

Yeah right,,,btw also try my recent problem More Modular in 2016

Log in to reply

hi

Log in to reply

@Otto Bretscher sorry to mention you here , but in this problem , I have added 1 to the lambda function , so deno. Won't be 0 ...

Log in to reply

Are we talking about the Liouville function as usual? That one takes the vales 1 and -1.

Log in to reply

@Otto Bretscher

There is no fun in doing Number Theory without you...:(

Log in to reply

I really don't want to post any more problems... then I have to deal with some of these obnoxious guys when they post solutions. Maybe I will give you some ideas and you can post, Comrade!

Log in to reply

I am really sorry , all this has happened because of me ...:( @Otto Bretscher

Log in to reply

@Chinmay Sangawadekar

Not at all... you are my best Comrade here,Log in to reply

@Otto Bretscher can you link me to some solutions like this, sorry if your experience in brilliant is harmed by them.

Log in to reply

Log in to reply

these solutions posted by obnoxious guys.

Log in to reply

Log in to reply

Log in to reply

Log in to reply

Humble Request: Please don't stop posting problems because of obnoxious guys. You are a crucial part of community and so are your problems. We enjoy your problems very much. If some guys are troubling you by any means , you may report it in private or on message board of any staff and the staff will take the appropriate action. Grooming math enthusiasts and comrades like Chinmay , Aareyan , me need your help on Brilliant , but if you stop posting problems like this for some reason you are not responsible for , we would be discouraged :(

Log in to reply

Log in to reply

Log in to reply

Oh lord no! Your problems are really integral to the community, sir. Please don't stop posting problems. As Nihar rightly did point out, you may report any such action to the staff, so that appropriate action can be taken. But please don't stop posting problems! :(

Log in to reply

@Otto Bretscher

Please look into my latest problem , Gauss won't help,, it is getting a lot of reports , but still I think problem may be right...help me comrade...

Log in to reply

It's great problem and your answer is correct, Comrade. You should write the Legendre symbol more clearly as $\left(\frac{n(n+1)}{10009}\right)$ though

Log in to reply

@Otto Bretscher dsorry to disturb you ...https://brilliant.org/problems/more-problems-in-2016-part-11/?group=JgjXt4dJvxew&ref_id=113

Log in to reply

@Aareyan Manzoor @Sharky Kesa see this problem......

this

Log in to reply

404 is a palindrome in base: -31

Log in to reply

Check my profile then...

Log in to reply

@Otto Bretscher

this and this

Kindly see into those problems...They are getting low response and also they are waiting for your awesome solutions...;)

Log in to reply

Looks like everybody is busy at school or work, including myself ;)

Log in to reply