Telescopic Sum

by P162008, Apr 24, 2025, 1:06 AM

Compute the value of $\Omega = \sum_{r=1}^{\infty} \frac{14 - 9r - 90r^2 - 36r^3}{7^r  r(r + 1)(r + 2)(4r^2 - 1)}$

Triple Sum

by P162008, Apr 24, 2025, 1:04 AM

Combinatorial Sum

by P162008, Apr 24, 2025, 1:03 AM

Combinatorial Sum

by P162008, Apr 24, 2025, 1:02 AM

Combinatorial Sum

by P162008, Apr 24, 2025, 12:56 AM

Number Theory

by fasttrust_12-mn, Aug 16, 2024, 10:21 AM

Find all integers $n$ for which $n^7-41$ is the square of an integer

binomial sum ratio

by thewayofthe_dragon, Jun 16, 2024, 6:39 PM

Someone please evaluate this ratio inside the log for any given n(I feel the sum doesn't have any nice closed form).
Attachments:

PAMO Problem 4: Perpendicular lines

by DylanN, Apr 9, 2019, 6:54 AM

The tangents to the circumcircle of $\triangle ABC$ at $B$ and $C$ meet at $D$. The circumcircle of $\triangle BCD$ meets sides $AC$ and $AB$ again at $E$ and $F$ respectively. Let $O$ be the circumcentre of $\triangle ABC$. Show that $AO$ is perpendicular to $EF$.

A wizard kidnaps 101 people

by Leicich, Aug 29, 2014, 11:33 PM

A wizard kidnaps $31$ members from party $A$, $28$ members from party $B$, $23$ members from party $C$, and $19$ members from party $D$, keeping them isolated in individual rooms in his castle, where he forces them to work.
Every day, after work, the kidnapped people can walk in the park and talk with each other. However, when three members of three different parties start talking with each other, the wizard reconverts them to the fourth party (there are no conversations with $4$ or more people involved).

a) Find out whether it is possible that, after some time, all of the kidnapped people belong to the same party. If the answer is yes, determine to which party they will belong.
b) Find all quartets of positive integers that add up to $101$ that if they were to be considered the number of members from the four parties, it is possible that, after some time, all of the kidnapped people belong to the same party, under the same rules imposed by the wizard.

IMO Shortlist 2013, Combinatorics #3

by lyukhson, Jul 9, 2014, 5:16 PM

A crazy physicist discovered a new kind of particle wich he called an imon, after some of them mysteriously appeared in his lab. Some pairs of imons in the lab can be entangled, and each imon can participate in many entanglement relations. The physicist has found a way to perform the following two kinds of operations with these particles, one operation at a time.
(i) If some imon is entangled with an odd number of other imons in the lab, then the physicist can destroy it.
(ii) At any moment, he may double the whole family of imons in the lab by creating a copy $I'$ of each imon $I$. During this procedure, the two copies $I'$ and $J'$ become entangled if and only if the original imons $I$ and $J$ are entangled, and each copy $I'$ becomes entangled with its original imon $I$; no other entanglements occur or disappear at this moment.

Prove that the physicist may apply a sequence of such operations resulting in a family of imons, no two of which are entangled.
This post has been edited 1 time. Last edited by elitza, Jun 16, 2022, 7:49 AM
Reason: Fixed typo.

A guide to the science of secrecy

avatar

fortenforge
Archives
Shouts
Submit
  • Good website!

    by bluegoose101, Aug 5, 2021, 6:28 PM

  • uh-huh, a great place here

    by fenchelfen, Sep 1, 2019, 11:30 AM

  • uh, yeah he is o_O

    by SonyWii, Oct 8, 2010, 2:11 PM

  • dude i think you're my roommate from camp :O

    by themorninglighttt, Aug 29, 2010, 10:06 PM

  • what i'm still not a contrib D:

    by SonyWii, Aug 6, 2010, 2:20 PM

  • I see what you did there

    by Jongy, Aug 1, 2010, 11:52 PM

  • omg, apparently you like cryptography; and apparently I'm not a contribb D:

    by SonyWii, Jul 26, 2010, 9:48 PM

  • Thank You

    by fortenforge, Jan 17, 2010, 6:35 PM

  • Wow this is a really cool blog

    by alkjash, Jan 16, 2010, 7:04 PM

  • Hi :)

    by fortenforge, Jan 7, 2010, 12:12 AM

  • Hi :)

    by Richard_Min, Jan 5, 2010, 9:29 PM

  • Hi :) :)

    by fortenforge, Jan 3, 2010, 10:14 PM

  • HELLO FORTENFORGE I AM THE PERSON SITTING NEXT TO YOU IN IDEAMATH

    by ButteredButNotEaten, Dec 24, 2009, 4:19 AM

  • @dragon96 Not if you celebrate Christmas with neon lights
    @batteredbutnotdefeated Sure, You are now a contributer

    by fortenforge, Dec 20, 2009, 4:39 AM

  • I too share a love for cryptography and cryptanalysis, may I be a contrib?

    by batteredbutnotdefeated, Dec 20, 2009, 2:38 AM

  • The green is too bright for Christmas. :P

    by dragon96, Dec 20, 2009, 2:12 AM

  • I thought I'd change the colors for the Holidays :lol:

    by fortenforge, Dec 13, 2009, 10:53 PM

  • hi, some "simple" cryptography here: http://www.artofproblemsolving.com/Forum/weblog_entry.php?t=317795

    by phiReKaLk6781, Dec 12, 2009, 3:46 AM

  • Yeah, that is binary, for modern cryptography, most text is converted to binary first and then algorithm's for encryption are preformed on the binary rather than the English letters. The text is converted using the ASCII table or UNICODE.

    by fortenforge, Oct 13, 2009, 10:33 PM

  • Whoa, I love your background! Is that binary?

    by pianogirl, Oct 13, 2009, 8:34 PM

  • Sure, I'll add you as a contributer...

    by fortenforge, Oct 2, 2009, 4:44 AM

  • May I make a post on one cipher I made up? (It's a good code for science people! *hint hint*)

    by dragon96, Oct 2, 2009, 4:04 AM

  • Nice blog, this is interesting... :lol:

    and guess who i am :ninja:

    by Yoshi, Sep 21, 2009, 4:02 AM

  • Thanks :lol:

    by fortenforge, Sep 17, 2009, 1:33 AM

  • Very interesting blog. Nice!

    by AIME15, Sep 16, 2009, 5:21 PM

  • When you mean 'write' do you mean like programming? Much of cryptography has to do with programming and most modern cryptographers are excellent programmers because modern complex ciphers are difficult to implement by hand.

    See if you can write a program for the substitution cipher. The user should be able to enter the key and the message. I know it is possible to do it in pretty much any language because I was able to do it in c.

    by fortenforge, Aug 7, 2009, 8:17 PM

  • Hello. I don't know much about advanced cryptography but I did write a Caeser Chipher encrypter and decrypter!

    by Poincare, Jul 31, 2009, 8:55 PM

27 shouts
Tags
About Owner
  • Posts: 200
  • Joined: Jan 17, 2009
Blog Stats
  • Blog created: Jun 21, 2009
  • Total entries: 48
  • Total visits: 126823
  • Total comments: 16
Search Blog
a