Jump to content

File:Frobenius problem 2p 5p.svg

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file (SVG file, nominally 512 × 384 pixels, file size: 3 KB)

Summary

Description Frobenius coin problem with 2-pence and 5-pence coins visualised as graphs by CMG Lee. Sloping lines denote graphs of 2x+5y=n where n is the total in pence, and x and y are the non-negative number of 2p and 5p coins, respectively. A point on a line gives a combination of 2p and 5p for its given total (green). Multiple points on a line imply multiple possible combinations (blue). Only lines with n = 1 or 3 have no points (red).
Source Own work
Author Cmglee

Licensing

I, the copyright holder of this work, hereby publish it under the following licenses:
w:en:Creative Commons
attribution share alike
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
GNU head Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.
You may select the license of your choice.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

image/svg+xml

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current21:32, 10 August 2024Thumbnail for version as of 21:32, 10 August 2024512 × 384 (3 KB)Cmglee{{Information |Description=Frobenius coin problem with 2-pence and 5-pence coins visualised as graphs by CMG Lee. Grey lines denote graphs of 2''x''+5''y''=''n'' where ''n'' is the total in pence, and ''x'' and ''y'' are the non-negative number of 2p and 5p coins, respectively. A point on a line gives a combination of 2p and 5p for its given total (green). Multiple points on a line imply multiple possible combinations (blue). Only lines with ''n'' = 1 or 3 have no points (red). |Source={{own}...

The following page uses this file:

Metadata