Jump to content

Ok...Now, this is CHEAP


Ellen

Recommended Posts

2 minutes ago, TrollBait said:

younger shriya is not good. especially there's a movie with Tarun where she's CEO in UK/US.. horrible movie.

kriti kharbandha also got crazy hot after she dumped TFI. yay!!!!

our guys are obsessed with chubby girls, with a virgin look. lol. losers.

CITI_c$y good observation skills lol

Link to comment
Share on other sites

33 minutes ago, Ellen said:

Moorkhuda...this is the  most difficult mathematical problem. If u solved it in 2012, Paul Erdos would meet u personally and give u cash. You might even win a fields medal.  Adi kuda telida? Boothulu kakunda inkemana nerpichara mee school lo? Kanisam Fermat's last theorem anna nerpichara?  Daniki solution undo ledo telsa?inthena nee saduv?

adhi @BeautyQueen status ra @Android_Howle ga aada boothul eda kanapadday niku

Link to comment
Share on other sites

1 minute ago, BeautyQueen said:

What is ur problem man??? Stop quoting us if u cannot speak anything nice.. 

arey oo @sanjana ni status endhi ra bhai atlundhi Telusukoni em feekthav bhey

Link to comment
Share on other sites

15 minutes ago, Patient31Covid19 said:

adhi @BeautyQueen status ra @Android_Howle ga aada boothul eda kanapadday niku

 

10 minutes ago, Patient31Covid19 said:

arey oo @sanjana ni status endhi ra bhai atlundhi Telusukoni em feekthav bhey

Dear God, what is it like in your funny little brain?  it must be so boring.  

Poni atleast answer me this , this is pretty easy:

For a positive integer nn, let ϕ(n) denote the Euler-Totient Function and p(n) denote the number of primes not exceeding n which do not divide n. Then consider the equivalence relation for which p(n) = ϕ(n) - 1.

For how many values n, does the relation hold?

Link to comment
Share on other sites

Just now, Ellen said:

 

Dear God, what is it like in your funny little brain?  it must be so boring.  

Poni atleast answer me this , this is pretty easy:

For a positive integer nn, let ϕ(n)ϕ(n) denote the Euler-Totient Function and p(n)p(n) denote the number of primes not exceeding nn which do not divide nn. Then consider the equivalence relation for which p(n)p(n) = ϕ(n) - 1ϕ(n)−1.

For how many values nn, does the relation hold?

@3$%@3$%

Link to comment
Share on other sites

6 minutes ago, Ellen said:

 

Dear God, what is it like in your funny little brain?  it must be so boring.  

Poni atleast answer me this , this is pretty easy:

For a positive integer nn, let ϕ(n)ϕ(n) denote the Euler-Totient Function and p(n)p(n) denote the number of primes not exceeding nn which do not divide nn. Then consider the equivalence relation for which p(n)p(n) = ϕ(n) - 1ϕ(n)−1.

For how many values nn, does the relation hold?

32

Link to comment
Share on other sites

Just now, chittimallu_14 said:

32

Only 10 re. The relation holds true only for the following numbers:

1, 2, 3, 4, 6, 8, 12, 18, 24, and 30

 

Link to comment
Share on other sites

4 minutes ago, Ellen said:

Only 10 re. The relation holds true only for the following numbers:

1, 2, 3, 4, 6, 8, 12, 18, 24, and 30

 

yeah it was a typo... i meant 10 

  • Haha 2
Link to comment
Share on other sites

1 minute ago, BeautyQueen said:

Urike eppude insta lo chusa :D so many trolls there on this issue 

inthaka mundhu paidithalli posted the same saramsam, but I trolled him.

hehe..

Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Reply to this topic...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

×
×
  • Create New...