Scribd Logo
Upload

Welcome to Scribd!

  • Further Challenge 1) Drive A Formula Where Non of The Variables Is

    Uploaded by

    Dodoahmed Ahmed
    2 views1 page
    The document describes a game with 42 players where each player has their own badge worth 3 points and their target's badge is worth 3 points. All other badges are worth 1 point. Players win by collecting 6 points. The maximum number of players that can win is 14 and the chance of this formation occurring is very low. A formula is proposed where the maximum number of winners (N) is calculated based on variables (x, y, z) where none of the variables are consistent. The game and formula are inspired by an anime.

    Original Description:

    chek

    Original Title

    Math

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a game with 42 players where each player has their own badge worth 3 points and their target's badge is worth 3 points. All other badges are worth 1 point. Players win by collecting 6 points. The maximum number of players that can win is 14 and the chance of this formation occurring is very low. A formula is proposed where the maximum number of winners (N) is calculated based on variables (x, y, z) where none of the variables are consistent. The game and formula are inspired by an anime.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    2 views1 page

    Further Challenge 1) Drive A Formula Where Non of The Variables Is

    Uploaded by

    Dodoahmed Ahmed
    The document describes a game with 42 players where each player has their own badge worth 3 points and their target's badge is worth 3 points. All other badges are worth 1 point. Players win by collecting 6 points. The maximum number of players that can win is 14 and the chance of this formation occurring is very low. A formula is proposed where the maximum number of winners (N) is calculated based on variables (x, y, z) where none of the variables are consistent. The game and formula are inspired by an anime.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 1

    In a game, there are 42 players.

    The purpose of the game is to


    collect 6 points by stealing other badges.
     Each player has his own badge worth 3 points
     Each player has his own target. Their target’s badge is worth 3
    points for them
     Each other badge apart from your target’s one is worth 1 point

    1) What is maximum number of players that can win such


    game? And the chance for such formation to happen

    Further challenge
    1) Drive a formula where non of the variables is
    consistent for maximum winners
    N = mx+by+cz

    Inspired by an anime I have watched

    You might also like