Snippets tagged sumBy
-
Project Euler #182
The RSA encryption is based on the following procedure: Generate two distinct primes p and q. Compute n=pq and phi=(p-1)(q-1). Find an integer e, 1
Like the snippet!Posted: 15 years ago by Natallie Baikevich
-
Basic F# LINQ GroupBy example and multiple aggregates
Converting F# LINQ queries to SQL: - Basic example of simple group-by - Also if you want to have multiple aggregates (SUM, COUNT, MAX, MIN, AVG, ...) in the same SQL-clause, that is done with groupBy over a constant value.
2 people like this
Like the snippet!Posted: 6 years ago by Tuomas Hietanen
-
Seq.sumBy implemented in terms of Seq.fold
Seq.sumBy implemented in terms of Seq.fold
2 people like this
Like the snippet!Posted: 14 years ago by ildjarn