You are not logged in. Please login at to post your questions!


can't understand

Can anyone help me understand how to find nth catalan number mod a prime number? I found this but am not able to understand it. (the last solution posted by Ben Voigt) I am lost at the line

Use the Sieve of Eratosthenes to find and store pairs of factors for all composite number sieve

What does it mean and how to find it? I couldn't make out this part in the code provided there

P.S. I understand the approach. Just not the implementations.


asked 18 Mar '15, 15:04

dragonemperor's gravatar image

accept rate: 10%

edited 18 Mar '15, 20:11

The link is redirected to here.

(18 Mar '15, 19:59) mediocoder3★

toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 18 Mar '15, 15:04

question was seen: 682 times

last updated: 18 Mar '15, 20:11