---
title: "Discussion on \"Understanding Derangements – The Art of No Fixed Points in Combinatorics\" | Hashnode"
description: "Discussion on \"Understanding Derangements – The Art of No Fixed Points in Combinatorics\". How to Count Arrangements with Zero Correct Positions"
url: "https://hashnode.com/posts/understanding-derangements-the-art-of-no-fixed-points-in-combinatorics/69821e49e89ffd98d0c2160a"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Understanding Derangements – The Art of No Fixed Points in Combinatorics](https://srinivastechblog.hashnode.dev/understanding-derangements-the-art-of-no-fixed-points-in-combinatorics?utm_source=hashnode&utm_medium=feed)

How to Count Arrangements with Zero Correct Positions

Feb 3 · 9 min read · srinivastechblog.hashnode.dev  
Updated Feb 15  
Read the article

-   [#derangements](https://hashnode.com/tag/derangements)
-   [#mathematics](https://hashnode.com/tag/mathematics)
-   [#dsa](https://hashnode.com/tag/dsa)
-   [#combinatorics](https://hashnode.com/tag/combinatorics)
-   [#competitive-programming](https://hashnode.com/tag/competitive-programming)

## Written by

[Muppidi Srinivas](https://hashnode.com/@srinivas364)

@srinivas364 · India

  
[View profile](https://hashnode.com/@srinivas364)

Simplifying DSA & Tech Concepts

I break down complex programming and DSA topics into simple, beginner-friendly explanations. Currently learning, building, and sharing my journey in tech.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
