Back Criba de Sundaram Spanish Sundaramen bahea Basque Crible de Sundaram French सीव ऑफ़ सुंदरम Hindi Crivello di Sundaram Italian サンダラムの篩 Japanese ਸੁੰਦਰਮ ਦੀ ਛਾਣਨੀ Punjabi Crivo de Sundaram Portuguese Решето Сундарама Russian Сундарамово сито Serbian
In mathematics, the sieve of Sundaram is a variant of the sieve of Eratosthenes, a simple deterministic algorithm for finding all the prime numbers up to a specified integer. It was discovered by Indian student S. P. Sundaram in 1934.[1][2]
- ^ V. Ramaswami Aiyar (1934). "Sundaram's Sieve for Prime Numbers". The Mathematics Student. 2 (2): 73. ISSN 0025-5742.
- ^ G. (1941). "Curiosa 81. A New Sieve for Prime Numbers". Scripta Mathematica. 8 (3): 164.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search